ppxscal/embedding_network huggingface dataset:
TPT-RAID: a High Performance Box-Fault Tolerant Storage System
Authors: Yitzhak Birk, Erez Zilber
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

TPT-RAID is a multi-box RAID wherein each ECC group comprises at most one block from any given storage box, and can thus tolerate a box failure. It extends the idea of an out-of-band SAN controller into the RAID: data is sent directly between hosts and targets and among targets, and the RAID controller supervises ECC calculation by the targets. By preventing a communication bottleneck in the controller, excellent scalability is achieved while retaining the simplicity of centralized control. TPT-RAID, whose controller can be a software module within an out-of-band SAN controller, moreover conforms to a conventional switched network architecture, whereas an in-band RAID controller would either constitute a communication bottleneck or would have to also be a full-fledged router. The design is validated in an InfiniBand-based prototype using iSCSI and iSER, and required changes to relevant protocols are introduced.
Urban Computing and Mobile Devices
Authors: Piotr Adamczyk, Kevin Hamilton, Alan Chamberlain, Steve Benford, Nick Tandavanitj, Amanda Oldroyd, Kate Hartman, Kati London, Sai Sriskandarajah, Eiman Kanjo, Peter Lanshoff, Kaoru Sezaki, Shin'ichi Konomi, Muaz A. Niazi, Hafiz F. Ahmad, Fauzan Mirza, Arshad Ali, George Roussos, Dikaios Papadogkonas, Mark Levene
Venue: IEEE Distributed Systems Online (2007)

Learn about projects on participant-environment interaction, the leveraging of information from mobile sensors, user authentication, and urban computing navigation.
Modeling the Impact of Checkpoints on Next-Generation Systems
Authors: Ron A. Oldfield, Sarala Arunagiri, Patricia J. Teller, Seetharami Seelam, Maria Ruiz Varela, Rolf Riesen, Philip C. Roth
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

The next generation of capability-class, massively parallel processing (MPP) systems is expected to have hundreds of thousands of processors. For application-driven, periodic checkpoint operations, the state-of-the-art does not provide a solution that scales to next-generation systems. We demonstrate this by using mathematical modeling to compute a lower bound of the impact of these approaches on the performance of applications executed on three massive-scale, in-production, DOE systems and a theoretical petaflop system. We also adapt the model to investigate a proposed optimization that makes use of "lightweight" storage architectures and overlay networks to overcome the storage system bottleneck. Our results indicate that (1) as we approach the scale of next-generation systems, traditional checkpoint/restart approaches will increasingly impact application performance, accounting for over 50% of total application execution time; (2) although our alternative approach improves performance, it has limitations of its own; and (3) there is a critical need for new approaches to fault tolerance that allow continuous computing with minimal impact on application scalability.
Studies on Fuzzy Information Measures
Authors: Shifei Ding, Zhongzhi Shi, Shixiong Xia, Fengxiang Jin
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Fuzzy information measures play an important part in measuring the similarity degree between two pattern vectors in fuzzy circumstance. In this paper, two new fuzzy information measures are set up. Firstly, the classical similarity measures, such as dissimilarity measure (DM) and similarity measure (SM) are studied, an axiom theory about fuzzy entropy is surveyed, and all kinds of definitions of fuzzy entropy are discussed. Secondly, based on the idea of Shannon information entropy, two concepts of fuzzy joint entropy and fuzzy conditional entropy are proposed and the basic properties of them are given and proved. At last, two new measures, fuzzy absolute information measure (FAIM) and fuzzy relative information measure (FRIM), are set up, which can be used to measure the similarity degree between a fuzzy set A and a fuzzy set B. So, It provides a new research approach for studies on pattern similarity measure.
Clock delayed domino logic with efficient variable threshold voltage keeper
Authors: Amir Amirabadi, Ali Afzali-Kusha, Yousof Mortazavi, Mehrdad Nourani
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

In this paper, efficient clock delayed domino logic with variable strength voltage keeper is proposed. The variable strength of the keeper is achieved through applying two different body biases to the keeper. The circuits used to generate the body biases are called capacitive body bias generator and cross-coupled capacitive body bias generator. Compared to a previous work, the body bias generator circuits presented in this paper are simpler and do not require double or triple power supply while consuming less area and power. To show the efficiency of the proposed technique, the implementation of a carry generator circuit by the proposed techniques and the previous work are compared. The simulation results for standard CMOS technologies of 0.18 µm and 70 nm show considerable improvements in terms of power and power delay product. In addition, the proposed technique shows much less temperature dependence when compared to that of previous work.
Management of Meta Knowledge for RDF Repositories
Authors: Bernhard Schueler, Sergej Sizov, Steffen Staab
Venue: Proceedings of the International Conference on Semantic Computing (2007)

The integration of knowledge from heterogeneous information sources and applications does not only require the conceptual mapping of information structures, but it also requires the treatment of semantic meta knowledge (i.e. knowledge about knowledge) in a generic manner. We describe a generic mechanism for (i) modeling and (ii) querying semantic meta knowledge in the context of RDF repositories. We substantiate our approach by use cases from a project about multi-modal information integration from different information sources.
Data bubbles for non-vector data: speeding-up hierarchical clustering in arbitrary metric spaces
Authors: Jianjun Zhou, Jörg Sander
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

To speed-up clustering algorithms, data summarization methods have been proposed, which first summarize the data set by computing suitable representative objects. Then, a clustering algorithm is applied to these representatives only, and a clustering structure for the whole data set is derived, based on the result for the representatives. Most previous methods are, however, limited in their application domain. They are in general based on sufficient statistics such as the linear sum of a set of points, which assumes that the data is from a vector space. On the other hand, in many important applications, the data is from a metric non-vector space, and only distances between objects can be exploited to construct effective data summarizations. In this paper, we develop a new data summarization method based only on distance information that can be applied directly to non-vector data. An extensive performance evaluation shows that our method is very effective in finding the hierarchical clustering structure of non-vector data using only a very small number of data summarizations, thus resulting in a large reduction of runtime while trading only very little clustering quality.
Equivalence checking in C-based system-level design by sequentializing concurrent behaviors
Authors: Thanyapat Sakunkonchak, Takeshi Matsumoto, Hiroshi Saito, Satoshi Komatsu, Masahiro Fujita
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

In system-level designs, since many incremental refinements are applied to the designs, equivalence checking between each refinement should be applied. However, proving whether two concurrent designs are equivalent is a difficult task, not to mention that the concurrent design itself can be error-prone. In this paper, we propose an equivalence checking method for C-based descriptions of system-level designs by sequentializing the concurrent behaviors. Before sequentializing concurrent behaviors, we need to check that the design must not contain neither deadlock nor race condition. After the sequentialization, equivalence checking is performed by symbolic simulation. To show that our methodology can be applied to practical designs, we experiment with some SpecC designs developed by University of California Irvine (UCI). The results show that the proposed method is promising. Although the size of some designs are large, with heuristic search for concurrency and synchronization, the size of designs are reduced accordingly and hence we can perform equivalence checking with the sequentialized ones.
Treebanks gone bad: Parser evaluation and retraining using a treebank of ungrammatical sentences
Authors: Jennifer Foster
Venue: International Journal on Document Analysis and Recognition (2007)

This article describes how a treebank of ungrammatical sentences can be created from a treebank of well-formed sentences. The treebank creation procedure involves the automatic introduction of frequently occurring grammatical errors into the sentences in an existing treebank, and the minimal transformation of the original analyses in the treebank so that they describe the newly created ill-formed sentences. Such a treebank can be used to test how well a parser is able to ignore grammatical errors in texts (as people do), and can be used to induce a grammar capable of analysing such sentences. This article demonstrates these two applications using the Penn Treebank. In a robustness evaluation experiment, two state-of-the-art statistical parsers are evaluated on an ungrammatical version of Sect. 23 of the Wall Street Journal (WSJ) portion of the Penn treebank. This experiment shows that the performance of both parsers degrades with grammatical noise. A breakdown by error type is provided for both parsers. A second experiment retrains both parsers using an ungrammatical version of WSJ Sections 2&#x2013;21. This experiment indicates that an ungrammatical treebank is a useful resource in improving parser robustness to grammatical errors, but that the correct combination of grammatical and ungrammatical training data has yet to be determined.
Web-based instruction for high school students: exploration of individual and cultural learning styles
Authors: Young Sam Ryu, Chang Soo Nam, Tonya L. Smith-Jackson
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

This study explored learning styles from both individual and cultural perspectives using web-based instruction for high school students as the context. Two web-based instructional systems teaching the same concept and theory of the Global Positioning System (GPS) were developed, each of the instructional systems accommodating different media attributes such as text, audio, and animation. To explore the role of learning styles as individual and cultural attributes, two ethnic groups, European-American (EA) and African-American (AA), were selected as the participants of the study. The Felder-Solomon Learning Style Questionnaire (FSLSQ) was used to measure the individual learning style. Questionnaires administered within a focus group setting were used to measure understandability, motivation, excitement, and ease-of-use for the two different interface designs. As results, AA students preferred a web-based tutorial designed with interface design guidelines that were compatible with their cultural learning preferences. It was observed that no learning style dimensions differed significantly between the two ethnic groups. Also, active and visual learners reported benefit from the AA-based instructional system, which employed multimedia elements such as animation and sound effects involving a greater amount of human-computer interaction.
The Projection Explorer: A Flexible Tool for Projection-based Multidimensional Visualization
Authors: Fernando V. Paulovich, Maria Cristina F. Oliveira, Rosane Minghim
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Multidimensional projections map data points, defined in a high-dimensional data space, into a 1D, 2D or 3D representation space. Such a mapping may be typically achieved with dimensional reduction, clustering, or force directed point placement. Projections can be displayed and navigated by data analysts by means of visual representations, which may vary from points on a plane to graphs, surfaces or volumes. Typically, projections strive to preserve distance relationships amongst data points, as defined in the original space. Information loss is inevitable and the projection approach defines the extent to which the distance preserving goal is attained. We introduce PEx -- the Projection Explorer -- a visualization tool for mapping and exploration of high-dimensional data via projections. A set of examples -- on both structured (table) and unstructured (text) data -- illustrate how projection based visualizations, coupled with appropriate exploration tools, offer a flexible set-up for multidimensional data exploration. The projections in PEx handle relatively large data sets at a computational cost adequate to user interaction.
Remote activation of ICs for piracy prevention and digital right management
Authors: Yousra Alkabani, Farinaz Koushanfar, Miodrag Potkonjak
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

We introduce a remote activation scheme that aims to protect integrated circuits (IC) intellectual property (IP) against piracy. Remote activation enables designers to lock each working IC and to then remotely enable it. The new method exploits inherent unclonable variability in modern manufacturing for unique identification (ID) and integrated the IDs into the circuit functionality. The objectives are realized by replication of a few states of the finite state machine (FSM) and adding control to the state transitions. On each chip, the added control signals are a function of the unique IDs and are thus unclonable. On standard benchmark circuits, the experimental results show that the novel activation method is stable, unclonable, attack-resilient, while having a low overhead and a unique key for each IC.
A Nonparametric Approach to Pricing Convertible Bond via Neural Network
Authors: Wei Zhou, Meiying Yang, Liyan Han
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

The paper proposes a nonparametric method for estimating the price of convertible bonds using artificial neural networks (ANNs). Market convertible bonds prices quoted on the Shanghai stock exchange are used for performance comparison between the parametric Black-Scholes (BS), binary tree model and the proposed ANN model. The input variables of model are investigated and the results are compared. The results show that the performances of the proposed model produce often better convertible bonds price than other parametric models. The model simulation results slightly lower than actual market prices generally, which are significant and differ from previous literatures.
Impedance extraction for 3-D structures with multiple dielectrics using preconditioned boundary element method
Authors: Yang Yi, Peng Li, Vivek Sarin, Weiping Shi
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In this paper, we present the first BEM impedance extraction algorithm for multiple dielectrics. The effect of multiple dielectrics is significant and efficient modeling is challenging. However, previous BEM algorithms, including FastImp and FastPep, assume uniform dielectric, thus causing considerable errors. The new algorithm introduces a circuit formulation which makes it possible to utilizes either multilayer Green's function or equivalent charge method to extract impedance in multiple dielectrics. The novelty of the formulation is the reduction of the number of unknowns and the application of the hierarchical data structure. The hierarchical data structure permits efficient sparsification transformation and preconditioners to accelerate the linear equation solver. Experimental results demonstrate that the new algorithm is accurate and efficient. For uniform dielectric problems, the new algorithm is one magnitude faster than FastImp, while its results differ from FastImp within 2%. For multiple dielectrics problems, its relative error with respect to HFSS is below 3%.
Integrating OOP and tasking: the missing requeue
Authors: A. J. Wellings, A. Burns
Venue: Proceedings of the 13th international workshop on Real-time Ada (2007)

Ada 2005 has provided limited integration between its object-oriented programming and tasking facilities. The compromise has been to allow tasks and protected types to support interfaces but not inheritance. Whilst the language supports timed/conditional entry calls and the select-thenabort statement using interfaces, it does not allow the target of a requeue statement to be determined via an interface. This paper argues that this design decision needlessly limits the expressive power of the language. A motivating example is used to illustrate the case, and the semantics of the proposed language extension are discussed.
Integrated Project Support with IStar
Authors: M. Dowson
Venue: IEEE Software (1987)

Most integrated environments are built bottom-up, starting with language tools. But this limits comprehensive project support. IST's system focuses on the overall project task instead.
A multimedia broker to support accessible and mobile learning through learning objects adaptation
Authors: Paola Salomoni, Silvia Mirri, Stefano Ferretti, Marco Roccetti
Venue: ACM Transactions on Internet Technology (TOIT) (2008)

The large diffusion of e-learning technologies represents a great opportunity for underserved segments of population. This is particularly true for people with disabilities for whom digital barriers should be overstepped with the aim of reengaging them back into society to education. In essence, before a mass of learners can be engaged in a collective educational process, each single member should be put in the position to enjoy accessible and customized educational experiences, regardless of the wide diversity of their personal characteristics and technological equipment. To respond to this demand, we developed LOT (Learning Object Transcoder), a distributed PHP-based service-oriented system designed to deliver flexible and customized educational services for a multitude of learners, each with his/her own diverse preferences and needs. The main novelty of LOT amounts to a broking service able to manage the transcoding activities needed to convert multimedia digital material into the form which better fits a given student profile. Transcoding activities are performed based on the use of Web service technologies. Experimental results gathered from several field trials with LOT (available online at http://137.204.74.83/&sim;lot/) have confirmed the viability of our approach.
An optimal discrete rate allocation for overlay video multicasting
Authors: B. Akbari, H. R. Rabiee, M. Ghanbari
Venue: Computer Communications (2008)

Recently, overlay multicasting has been considered as an important approach for providing multicast services over the Internet. Due to the limited capacity and the heterogeneity of the Internet clients, using overlay multicasting for video streaming applications is a challenging task. Designing bandwidth-efficient overlay structures and optimal resource allocation are the most important techniques that can be considered to deal with these challenges. In this paper, we propose an optimal distributed rate allocation scheme to solve the rate allocation problem in overlay multirate video multicasting systems. Our objective in the optimal rate allocation algorithm is the optimization of the overall video quality perceived within the multicast group members that organize themselves into an overlay tree. In our proposed solution, each overlay node of a given overlay tree allocates the rates to its children in a way that the overall video quality perceived in the multicast group is optimized. In addition to the mathematical analysis of the algorithm, its effectiveness is supported through simulation.
Nonlinear Boosting Projections for Ensemble Construction
Authors: Nicolás García-Pedrajas, César García-Osorio, Colin Fyfe
Venue: The Journal of Machine Learning Research (2007)

In this paper we propose a novel approach for ensemble construction based on the use of nonlinear projections to achieve both accuracy and diversity of individual classifiers. The proposed approach combines the philosophy of boosting, putting more effort on difficult instances, with the basis of the random subspace method. Our main contribution is that instead of using a random subspace, we construct a projection taking into account the instances which have posed most difficulties to previous classifiers. In this way, consecutive nonlinear projections are created by a neural network trained using only incorrectly classified instances. The feature subspace induced by the hidden layer of this network is used as the input space to a new classifier. The method is compared with bagging and boosting techniques, showing an improved performance on a large set of 44 problems from the UCI Machine Learning Repository. An additional study showed that the proposed approach is less sensitive to noise in the data than boosting methods.
Data distribution for dense factorization on computers with memory heterogeneity
Authors: Alexey Lastovetsky, Ravi Reddy
Venue: Parallel Computing (2007)

In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the problem that use a constant performance model of processors, when the relative speed of each processor is represented by a positive constant. We also propose a new efficient algorithm, called the Reverse algorithm, solving the problem with the constant performance model. We extend the presented algorithms to the functional performance model, representing the speed of a processor by a continuous function of the task size. The model, in particular, takes account of memory heterogeneity and paging effects resulting in significant variations of relative speeds of the processors with the increase of the task size. We experimentally demonstrate that the functional extension of the Reverse algorithm outperforms functional extensions of traditional algorithms.
On the flexibility of toroidal embeddings
Authors: Neil Robertson, Xiaoya Zha, Yue Zhao
Venue: Journal of Combinatorial Theory Series B (2008)

Two embeddings @J"1 and @J"2 of a graph G in a surface @S are equivalent if there is a homeomorphism of @S to itself carrying @J"1 to @J"2. In this paper, we classify the flexibility of embeddings in the torus with representativity at least 4. We show that if a 3-connected graph G has an embedding @J in the torus with representativity at least 4, then one of the following holds:(i)@J is the unique embedding of G in the torus; (ii)G has three nonequivalent embeddings in the torus, G is the 4-cube Q"4 (or C"4xC"4), and each embedding of G forms a 4-by-4 toroidal grid; (iii)G has two nonequivalent embeddings in the torus, and G can be obtained from a toroidal 4-by-4 grid (faces are 2-colored) by splitting i(i=