ppxscal/embedding_network huggingface dataset:
The Design of Dependency Relationships Matrix to improve the testability of Component-based Software
Authors: Liangli Ma, Houxiang Wang, Yansheng Lu
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Component-based software development technique and its intensive use in the industry has led to the wide research in various aspects of component-based systems(CBSs). And its relating quality assurance techniques had become the key research content. This paper summarizes eight types of dependency between two components in the CBSs. And it discusses about a dependency-based representation called the component dependency graph(CDG) and the component direct dependency graph(CDDG), and then gives the definition of dependency relationship matrix of the component Cm (CmDM) and detailed dependency relationship matrix of the component Cm(CmDDM). Based on these, we further present two approaches to find dependencies relationships between two components: code-based approach and specificationbased approach. Finally, we apply an application example implementing integration testing when a component named RegisterGrade is integrated into a CBS, and present a table with test coverage figure to illustrate the validity of our approach.
Assessing Approximate Inference for Binary Gaussian Process Classification
Authors: Malte Kuss, Carl Edward Rasmussen
Venue: The Journal of Machine Learning Research (2005)

Gaussian process priors can be used to define flexible, probabilistic classification models. Unfortunately exact Bayesian inference is analytically intractable and various approximation techniques have been proposed. In this work we review and compare Laplace's method and Expectation Propagation for approximate Bayesian inference in the binary Gaussian process classification model. We present a comprehensive comparison of the approximations, their predictive performance and marginal likelihood estimates to results obtained by MCMC sampling. We explain theoretically and corroborate empirically the advantages of Expectation Propagation compared to Laplace's method.
An agent-based peer-to-peer grid computing architecture: convergence of grid and peer-to-peer computing
Authors: Jia Tang, Minjie Zhang
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

The conventional computing Grid has developed a service oriented computing architecture with a super-localresource management and scheduling strategy. This architecture is limited in modeling computer systems with highly dynamic and autonomous computing resources due to its server-based computing model. The super-local resource management and scheduling strategy also limits the utilization of the computing resources. In this paper, we propose a multi-agent based Peer-to-Peer Grid computing architecture.This novel architecture solves the above issues, while provides reasonable compatibility and interoperability with the conventional Grid systems and clients. The main characteristics of this architecture are highlighted by its promising performance and scalability, and its adaptive resource management and scheduling mechanisms. With this architecture, is promising to build large scale high performance commodity computing Grids at low cost.
Learning to Predict Salient Regions from Disjoint and Skewed Training Sets
Authors: Larry Shoemaker, Robert E. Banfield, Lawrence O. Hall, Kevin W. Bowyer, W. Philip Kegelmeyer
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

We present an ensemble learning approach that achieves accurate predictions from arbitrarily partitioned data. The partitions come from the distributed processing requirements of a large scale simulation where the volume of the data is such that classifiers can train only on data local to a given partition. As a result of the partition reflecting the need for efficient simulation analysis, rather than the needs of data mining, the class statistics vary across partitions; indeed some classes will likely be absent from some partitions. We combine a fast ensemble learning algorithm with majority voting to generate an accurate working model of the simulation. Results from several simulations show that regions of interest are successfully identified in spite of training set class imbalances. Accuracy is analyzed both at the level of nodes in the simulation data structure, and in terms of higher-level regions of interest. It is shown that over 98% of salient regions are found in independent test sets. Hence, this approach will be a significant time saver for simulation users and developers.
Practical Fault-Tolerant Framework for eScience Infrastructure
Authors: Hyuck Han, Jai Wug Kim, Jongpil Lee, Young Jin Yu, Kiyoung Kim, Heon Y. Yeom
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Many areas of science currently use computing resources as a important part of their research, and many research groups adopt cluster architecture to use them efficiently and manage them easily. Therefore, faulttolerance becomes a very important property for the computing resources. However, fault-tolerant systems have not yet been widely adopted because they are either hard to deploy, hard to use, hard to manage, hard to maintain, or hard to justify. This paper proposes a practical fault-tolerant system for eScience infrastructures. Our system uses checkpoint/ restart mechanism for fault-tolerance, and provides a easy mechanism to integrate with Grid services widely used in eScience. Additionally, we run rigorous tests using scientific applications to verify that our system can be used in clusters. We also describe improvements made to our system to solve various problems that arose when deploying it on a cluster. The experimental results show that not only does our system conform to various types of running environment well, but that it can also be practically deployed in clusters.
A formal model for designing dialogue strategies
Authors: Leila Amgoud, Nabil Hameurlain
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Modeling different types of dialogue between autonomous agents is becoming an important research issue. Several proposals exist with a clear definition of the dialogue protocol, which is the set of rules governing the high level behaviour of the dialogue. However, things seem different with the notion of strategy. There is no consensus on the definition of a strategy and on the parameters necessary for its definition. Consequently, there are no methodology and no formal models for strategies.This paper argues that a strategy is a two steps decision process: i) to select the type of act to utter at a given step of a dialogue, and ii) to select the content which will accompany the act. The first step consists of selecting among all the acts allowed by the protocol, the best option which according to some strategic beliefs of the agent will at least satisfy the most important strategic goals of the agent. The second step consists of selecting among different alternatives (eg. different offers), the best one which, according to some basic beliefs of the agent, will satisfy the functional goals of the agent. The paper proposes then a formal model based on argumentation for computing on the basis of the above kinds of mental states, the best move (act + content) to play at a given step of the dialogue.
Orchestrating Computing Objects Using Web-Services Technologies - An Intel IT Proof of Concept (POC)
Authors: Guy Yohanan, Jay Hahn-Steichen, Jim Hobbs, Jackson He
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

The challenge of ever-growing complexity within the IT enterprise accelerates the evolution of a fully autonomic framework. With the need of an agile IT infrastructure for ever-changing business needs, this evolution is bound to develop based on open standards. We have conducted a proof of concept (POC) using web services (WS) technologies in an enterprise manageability framework. The proof of concept focuses on a standard messaging layer for enterprise integration, standard and discoverable manageability interfaces, and a holistic object management approach. This paper presents a POC that uses WS standards to build a common "language between varieties of components within the enterprise. That common "language includes discoverable interfaces and a local metadata repository. Having this common communications framework with the ability to discover and control computing resources moves us ahead significantly toward the vision of an agile IT infrastructure, and enables the continuous evolution toward the vision of an autonomic enterprise in which holistic, end-to-end object management is possible. WS-Management (WS-Man), which is a messaging protocol dedicated to the purpose of system management, is the primary specification used in the POC. Among other things, this paper presents models to deal with key challenges like dynamic managedobject (MO) discovery and control, federated event processing across domains, and systems which reach beyond technology into business layers. The success of this POC proved that such an end-state vision can be achieved, and is a major step forward toward this goal.
Improving flow analyses via ΓCFA: abstract garbage collection and counting
Authors: Matthew Might, Olin Shivers
Venue: ACM SIGPLAN Notices (2006)

We present two independent and complementary improvements for flow-based analysis of higher-order languages: (1) abstract garbage collection and (2) abstract counting, collectively titled ΓCFA.Abstract garbage collection is an analog to its concrete counterpart: we determine when an abstract resource has become unreachable, and then reallocate it as fresh. This prevents flow sets from merging in the abstract, which has two immediate effects: (1) the precision of the analysis is increased, and (2) the running time of the analysis is frequently reduced. In some nontrivial cases, we achieve an order of magnitude improvement in precision and time simultaneously.In abstract counting, we track how many times an abstract resource has been allocated. A count of one implies that the abstract resource momentarily represents only one concrete resource. This, in turn, allows us to perform environment analysis and to expand the kinds (rather than just the degree) of optimizations available to the compiler.
Information synchronization effects on the stability of collaborative supply chain
Authors: Jayendran Venkateswaran, Young-Jun Son
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In this paper, the dynamics of a collaborative supply chain have been analyzed using transform techniques. The general conditions for stability of the supply chains are derived and the effects of inter-player sampling intervals are analyzed. System dynamics simulation models of the different members of the supply chain are developed. Z-transform techniques are employed to derive the general stability conditions (settings of control parameters that produce stable response). The variation in the supply chain's stability in response to the information synchronization frequency is examined by relating the update frequency to the sampling interval of the underlying difference equations. Existence of instability due to improper parameter selection and improper sampling interval selection is thus confirmed, and guidance for the selection of appropriate parameters to guarantee system stability is presented. Simulations are used to confirm our analysis and help demonstrate the stable or unstable behavior of the supply chain.
Image Denoising Via Learned Dictionaries and Sparse representation
Authors: Michael Elad, Michal Aharon
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We address the image denoising problem, where zeromean white and homogeneous Gaussian additive noise should be removed from a given image. The approach taken is based on sparse and redundant representations over a trained dictionary. The proposed algorithm denoises the image, while simultaneously trainining a dictionary on its (corrupted) content using the K-SVD algorithm. As the dictionary training algorithm is limited in handling small image patches, we extend its deployment to arbitrary image sizes by defining a global image prior that forces sparsity over patches in every location in the image. We show how such Bayesian treatment leads to a simple and effective denoising algorithm, with state-of-the-art performance, equivalent and sometimes surpassing recently published leading alternative denoising methods.
Using blended learning to enhance teaching and learning
Authors: Joe Luca
Venue: Proceedings of the 8th Austalian conference on Computing education - Volume 52 (2006)

Blended learning, or learning that combines different modes of delivery, such as online and traditional face-to-face learning, is increasingly becoming an attractive option as new and innovative technologies become increasingly available. However, technology alone cannot provide effective and efficient solutions for teaching and learning. Solid instructional design and pedagogical approaches must be used in conjunction with blended learning for success.This presentation will consider how to improve the process of teaching and learning by designing blended learning environments that are authentic, self-regulated and promote student reflection. The framework for designing instruction will be complemented with examples of pedagogical tools designed specifically to promote student engagement, as well as strategies for developing effective student project work to develop IT systems. Different approaches to teaching programming with online support will also be considered.The presentation will cover the following areas: the nature of our students; blended learning; learning theory; learning design; the role of assessment; a model for designing learning materials; new technology; online pedagogical tools and demonstrations.
IFIN -- ITIM Distributed GRID System
Authors: C. Alexa, V. Boldea, M. Ciubancan, S. Constantinescu, S. Dita, D. Pantea, T. Preda, M. Jalobeanu, G. Popeneciu
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

GRID technology is able to connect an unlimited number of computer systems and to distribute the tasks among all the connected nodes. In this paper we present the extension of IFIN-HH ATLAS-GRID facilities with ITIM Cluj-Napoca computing power, building a distributed GRID system. Also shown are the functionality tests as a single grid configuration. Since March 30 the ITIM Cluj-Napoca site is configured and connected to IFIN-HH ATLAS-GRID, through RoEduNet. Supported by the Romanian R&D Agency through CEEX program, this project combines particle physics phenomenology and GRID technologies for distributed computing and analysis.
Compressed video transmission over digital networks: analysis and design
Authors: Qing Tang, Jesse S. Jin
Venue: Selected papers from the 2002 Pan-Sydney workshop on Visualisation - Volume 22 (2003)

In the past two decades, new technologies in digital video compression have paved the way for video transmission. This is providing an environment for the widespread availability of a wide range of real video networking services.The purpose of this paper is to introduce fundamental principles and important technologies used in design and analysis of compressed video transmission systems over digital networks.We start with the overview of video transmission and video compression techniques and present gradually towards important issues of video transmission systems. The proposed error resilience approach will be addressed to some extent in last section.
Teaching biology to prospective elementary school teachers so as to promote transition from receiver to giver of information
Authors: Kathleen Fisher, Stacy Gomes
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

Advanced knowledge acquisition differs in important ways from introductory learning. Advanced knowledge acquisition refers to learning a content area beyond the introductory stage but before extensive experience and practice (Spiro, Coulson, Feltovich, and Anderson, 1988; Spiro & Nix, 1990; Jacobson & Spiro, 1995). At this stage, knowledge must be reasonably correct and active rather than inert. The goals of learning shift from knowledge reproduction to knowledge use. The theory was initially developed to describe the instructional needs of advanced medical students. It applies equally well to advanced undergraduates who are nearing completion of their professional program. In both cases, students need to attain a deeper understanding of content material, a sense of mastery over it, an ability to reason with it, and the fluency to apply it flexibly in diverse contents.
Validating a division I-A college football season simulation system
Authors: Rick L. Wilson
Venue: Proceedings of the 37th conference on Winter simulation (2005)

NCAA Division I-A college football remains the only major collegiate sport not to have a true playoff to determine its national champion. A controversial and flawed process termed the Bowl Championship Series (BCS) has emerged with the goal of matching two teams in a so-called 'national championship' game. The BCS has employed a varied set of computer-based ranking models to help determine the two participants. The effectiveness of these computer models has never been empirically investigated in a controlled setting. This paper presents the development of a controlled test-bed of simulated college football seasons, a necessary preliminary step. A simulation model is developed and validated against past college football season data. Results show promise. It is hoped that this simulation process will allow future systematic study of the various mathematical models used to rank football teams.
Mentoring in a school environment
Authors: Shanan Gibson, Dennis C. Neale, John M. Carroll, Christina A. Van Metre
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

We describe how the integration of multiple computer-mediated communication and collaboration technologies can support educational activity through mentoring in a local community context. We discuss the student and mentor expectations, their ongoing relationships, and the role that technology has played throughout their interactions.
Design of finite controllers for a classs of infinite systems for the H/sup /spl infin//-control problem
Authors: V. A. Brusin, A. V. Bovyrin
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

The problem in finite controller design for the H/sup /spl infin//-criteria fulfillment occur when an object is represented by hyperbolic type equations in partial derivatives. The presented method of finite controller design is based on results from [Brusin V.A. et al., 2001]. The controller's class is given. The theorems solving this problem are stated. Application to mechanical system is given.
A system for automated content organization
Authors: Guo-Qiang Zhang
Venue:  (2006)

The main goal of Information Retrieval (IR) is to facilitate information access from large document collections. Starting from a user's query, usually made in a natural language, a classic IR system retrieves a set of items relevant to the user's query and displays them as a ranked list. Search-engines are examples of IR Systems. They are effective in finding specific items, but search results for less specific information tend to be off-target, overwhelming, and less useful. In this thesis, we report the design, prototyping, and experiences of an experimental system called ACOSys for automated organization of content using menu/folder hierarchies based on a mathematical theory called Formal Concept Analysis (FCA). ACOSys utilizes the concept of FCA and the structure of a hierarchical menu to categorize search results into more specific groups. The resulting items can be found by quickly zeroing in on subfolders where they may reside, saving the effort of browsing through thousands of off-target items. The technical contribution of this thesis consists of the design and implementation of algorithms in three related categories. First, we develop the principle and the coding of a new algorithm for generating concepts and rules. We show by both theoretical and practical study that it is an efficient algorithm for both sparse and dense contexts. Second, we develop an algorithm for maintaining and updating the construction of concept lattices. In comparison to other incremental algorithms, our algorithm not only updates the concept set, but also updates the menu/folder structure; additional items can be added incrementally, and not as an overhaul. Third, instead of using a simple string-match, we provide a semi-automated process for keyword selection, which involves decision-making by a user based on measures such as the word-distribution statistics of a collection. By using the indexing strategy of the Berkeley DB (database system), context sensitive menu hierarchies are constructed in seconds, making ACOSys practical on large number of objects and attributes.
Adaptive impulse noise filtering
Authors: S. R. Kim, A. Efron
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors present a preprocessor to mitigate the effects of the impulse noise. In contrast with previous work, the proposed preprocessor requires no information about the correlated background process and can adapt as the background process changes. An adaptive nonlinear filter (preprocessor) introduced mitigates the effects of the impulses when the nominal process (background noise) is a correlated Gaussian process. The preprocessing procedure consists of identifying the impulsive component, eliminating it and replacing the samples with an estimate. Comparison of techniques for suppressing impulse noise is given.
Modeling of a EEPROM device based on silicon quantum dots embedded in high-k dielectrics
Authors: V. A. Gritsenko, K. A. Nasyrov, D. V. Gritsenko, Yu. N. Novikov, J. H. Lee, J. -W. Lee, C. W. Kim, Hei Wong
Venue: Microelectronic Engineering (2005)

The write/erase (W/E) and data retention characteristics of a memory device based on silicon/oxide/silicon dot/oxide/silicon structure were simulated. It was demonstrated that the replacement of the top blocking SiO"2 with high-k dielectric results in several important improvements of memory characteristics. In particular, the application of high-k dielectric as a top oxide enhances the electric field in the tunnel oxide, which allows using a thicker bottom oxide to improve the data retention time. In addition, in a new device the magnitude of the W/E pulse and the programming time can also be reduced. A typical design of the new structure leads to a programming duration of 10ms and maintains a memory window of 3V after 10-year data retention.
Methods for bounding end-to-end delays on an AFDX network
Authors: Hussein Charara, Jean-Luc Scharbarg, Jerome Ermont, Christian Fraboul
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

Architectures of avionics networks, such as that of the Airbus A380, currently know important evolutions. This is principally due to the increase in the complexity of the embedded systems, in term of rise in number of integrated functions and their connectivity. The evolution of Switched Ethernet technologies allows their implementation as an avionics architecture (AFDX: Avionics Full Duplex Switched Ethernet). The problem is then to prove that no frame will be lost by the network (no switch queue will overflow) and to evaluate the end-to-end transfer delay through the network. The objective of this paper is to present and shortly compare three methods for the evaluation of end-to-end delays: network calculus, queuing networks simulation and model checking.