ppxscal/embedding_network huggingface dataset:
Multiple Measures of Website Effectiveness and their Association with Service Quality in Health and Human Service Agencies
Authors: Eric W. Welch, Sanjay Pandey
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Although many different measures of website effectiveness have been developed, few studies have rigorously compared and contrasted the measures. Based on the organizational effectiveness literature, this paper first develops a framework for categorizing different e-government measures and compares three different quantitative measures of effectiveness of websites in state health and human services agenciesone used by researchers and two attributable to managers. The paper then develops a model to analyze (1) the organizational and environmental factors that determine website effectiveness and (2) how website effectiveness contributes to overall service quality of the agency. Low correlations among the three website measures indicate that effectiveness is a multidimensional concept: effectiveness depends upon the referent and the analyst's perspective. Similarly, model results show that different effectiveness measures are determined by categorically different sets of independent variables. Moreover, results show that in some cases website effectiveness is negatively associated with service quality.
Gauss-Hermite interval quadrature rule
Authors: Gradimir V. Milovanović, Aleksandar S. Cvetković
Venue: Computers Mathematics with Applications (2007)

The existence and uniqueness of the Gaussian interval quadrature formula with respect to the Hermite weight function on R is proved. Similar results have been recently obtained for the Jacobi weight on [-1,1] and for the generalized Laguerre weight on [0,+~). Numerical construction of the Gauss-Hermite interval quadrature rule is also investigated, and a suitable algorithm is proposed. A few numerical examples are included.
Building a pipeline of future college engineering students
Authors: M. A. McCartney
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

As part of Arizona State University's (ASU) K-12 outreach effort to increase the number of qualified minority students entering the College of Engineering and Applied Sciences (CEAS), the Office of Minority Engineering Programs (OMEP) has developed a collaborative effort with engineering faculty to expose high school students interested in math and science to the excitement of an engineering discipline. Underrepresented minority students and their teachers from eight high schools that participate in the Mathematics, Engineering, Science Achievement (MESA) Program, supported through OMEP, were invited to participate in a "willing worker" engineering assembly project in the ECE 100: Introduction to Engineering Design class. Their teachers who participated were MESA Program advisors. In Spring 95, forty enthusiastic high school students joined college students to get a first hand look at "life as an ASU engineering student". The comments from all parties involved were so positive that Dr. Barry McNeill, Assistant Professor of Mechanical and Aerospace Engineering invited 110 students to the classroom in the Fall of 1995. The authors look at this program.
Online change detection: Monitoring land cover from remotely sensed data
Authors: Yi Fang, Auroop R. Ganguly, Nagendra Singh, Veeraraghavan Vijayaraj, Neal Feierabend, David T. Potere
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

We present a fast and statistically principled approach for land cover change detection. The approach is illustrated with a geographic application that involves analyzing remotely sensed data to detect changes in the normalized difference vegetation index (NDVI) in near real time. We use the Wal-Mart land cover change data set as a nontraditional way to monitor and validate known cases of NDVI change. A reference distribution has been justified to fit the available data. An adaptive metric based on the exponentially weighted moving average (EWMA) of normal scores derived from p-values is tracked for new or streaming data, leading to alarms for large or sustained changes. A heuristic algorithm based on the property of the metric is proposed for change point detection. The proposed framework performed well on the validation dataset.
Association Bundle - A New Pattern for Association Analysis
Authors: Wenxue Huang, Milorad Krneta, Limin Lin, Jianhong Wu
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

In this paper we introduce the notion of association bundle as a new pattern for association analysis. Different from association rule which has the one-way association from rule antecedent to rule consequent, an association bundle has the two-way association between each pair of bundle elements. Association bundles present a more compact association pattern than association rules, and have meaningful interpretations in marketing applications including shelf arrangement and cross-selling by discounting. The identification of association bundles can be transformed into the problem of maximal clique enumeration, and very efficient algorithms can be applied. Our experimental results show that the time cost is less than two minutes on three real world data sets.
On Complexity of The Tightening Problem for Web Service Discovery
Authors: Zhongnan Shen, Jianwen Su
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

A goal of the service oriented paradigm/SOA is to facilitate automated service composition. Motivated by scenarios in e-business and e-science, the automated composition problem starts with a specification of a "goal" service and a set of searchable existing services. The composition problem relies on discovering relevant services at the semantic level, mainly, through entry/exit conditions, and assembling them into a "realization" of the goal service. Based on this framework, we study in this paper a tightening problem which strengthens service discovery queries formulated from conditions in the goal service. A tighter condition can find more relevant services while a looser one may exclude the possibility of assembling a goal realization. The tightening problem is studied for conditions in different logic languages, mainly, conditions with order constraints and linear arithmetic. The complexity of the tightening problem is given for both integers and real numbers.
Animation Metaphors for Object-Oriented Concepts
Authors: Jorma Sajaniemi, Pauli Byckling, Petri Gerdt
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Program visualization and animation has traditionally been done at the level of the programming language and its implementation in a computer. However, novices do not know these concepts and visualizations that build upon programming language implementation may easily fail in helping novices to learn programming concepts. Metaphor, on the contrary, involves the presentation of a new idea in terms of a more familiar one and can facilitate active learning. This paper applies a metaphor approach to object-oriented programming by presenting new metaphors for such concepts as class, object, object instantiation, method invocation, parameter passing, object reference, and garbage collection. The use of these metaphors in introductory programming education is also discussed.
UpdateNews: a news clustering and summarization system using efficient text processing
Authors: Takaharu Takeda, Atsuhiro Takasu
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

This paper proposes a news articles clustering and summarization system. It provides integrated access to news articles from various news sites. The system consists of a crawler, topic detector, and summarizer. This paper describes its efficient summarization technique to handle large amounts of crawled news articles.
Dynamic Contextual Adaptation
Authors: Antonio Brogi, Javier Cámara, Carlos Canal, Javier Cubo, Ernesto Pimentel
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

When developing systems based on COTS, components need to be adapted in most of the occasions to work under certain conditions which were not initially predicted by their developers. Thus, it is very important to provide systems with the skill to dynamically alter their behaviour while running, depending on the changing conditions of the environment. In this work we describe a context-dependent, dynamic mapping between the interfaces of the components being adapted, overcoming some of the limitations of the static mappings presented in previous works. This is achieved by means of contextual environments, which define flexible adaptation policies. We also present a case study, illustrating the proposal, and discuss the improvements these mappings represent in comparison with previous works, as well as some open issues.
TRaDe, a topological approach to on-the-fly race detection in java programs
Authors: Mark Christiaens, Koen De Bosschere
Venue: Proceedings of the 2001 Symposium on JavaTM Virtual Machine Research and Technology Symposium - Volume 1 (2001)

Debugging multi-threaded programs is notoriusly hard. Probably the worst type of bug occurring in multi-threaded programs is a data race. There is therefore a great need for tools to automatically detect data races during execution. This article presents, TRaDe, a novel approach to detect races in object-oriented languages using a topological approach. An implementation of TRaDe based on the Sun JVM 1.2.1 is compared with existing tools. TRaDe proves to be a factor 1.6 faster than any known race detection tool for Java and has memory requirements similar to the best competing tools.
Simulation-Based Game Learning Environments: Building and Sustaining a Fish Tank
Authors: Jason Tan, Gautam Biswas
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

This paper describes an approach, where an exploration- based simulation environment for conducting and observing science experiments is combined with a game environment to provide a learning environment that supports learning with understanding and transfer. We describe the components of the learning environment that includes active controls to create an "inspectable simulation, and a formative assessment scheme that aids monitoring and learning for novice learners. A preliminary experiment demonstrates the effectiveness of the simulation environment. In future, we will extend this environment by linking it to our teachable agent system, Betty's Brain, and develop a simulation-based "game environment that includes a sequence of challenges to further motivate the student and expand their learning abilities.
Sequencing of Concurrent Communication Traffic in a Mesh Multicomputer with Virtual Channels
Authors: Bing-rung Tsai, Kang G. Shin
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

Under the fixed-path e-cube routing in mesh multicomputers, we evaluate the performance of several low-overhead packet sequencing and flit multiplexing methods. In the presence of concurrent inter-node communication traffic, we found that unless proper packet sequencing is employed, adding more communication resources, such as links and buffers, can actually degrade the network performance. A good packet-sequencing policy combined with proper flit multiplexing is shown to improve performance by more than 30%.
The INFINITY Project: expanding signal-processing-based engineering education to the high school classroom
Authors: G. C. Orsak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper outlines the goals, structure, and technology elements of the INFINITY Project, a joint effort between university educators, industrial partners, and civic leaders to introduce a signal-processing-based engineering curriculum at the high school educational level. Implementation issues of the program are addressed, including class textbook and laboratory creation, teacher training, and online classroom support. Initial responses to the effort from teachers and students at fourteen different high schools are highly positive, and plans for further expansion of the program are given.
A Novel Pre-Process Method of Raw Point Data for Real-Time Complex Scenes Rendering
Authors: Lei Zhao, Duan-qing Xu, Yi Li, Yi-min Yu
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In this paper, we describe a rendering system that is capable of capturing and rendering dynamic environments at about 20 fps using a commercially available PC (1.8 GHz single processor) and IEEE 1394 cameras (each with resolution of 320×240). It does not rely on any additional custom hardware. Such a system permits streaming applications that involve real-time view synthesis from multiple cameras, such as 3-D teleconferencing or chatting. View synthesis is performed using the closest two cameras, and relies on plane sweeping to produce a photoconsistent virtual image. In addition, an alpha matte is estimated at the virtual view in order to improve the rendering quality at the foreground/background boundaries. We illustrate the performance of our system on several dynamic environment examples.
Software architecture using fine-grained event-driven reactive components
Authors: Paul Tarvydas, Norm Sanford
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

In this paper, we describe design motivations and experience with a visual language that treats the architecture of a reactive system as a composition of small, asynchronous software components communicating via data-carrying events. This paper traces out the learning curve which ultimately concluded in the design of an event-driven reactive visual language and runtime system that facilitates construction of operating systems and applications completely in the event-driven paradigm. The use of this system for developing distributed applications is discussed.
Robust Feature Extraction and Reduction of Mass Spectrometry Data for Cancer Classification
Authors: Tuan D. Pham, Vikram Chandramohan, Xiaobo Zhou, Stephen T. C. Wong
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Application of proteomics coupled with pattern classification techniques to discover novel biomarkers that can be used for the predictive diagnoses of several cancer diseases. However, for effective classification, the extraction of good features that can represent the identities of different classes plays the frontal critical factor for any classification problems. In addition, another major problem associated with pattern recognition is how to effectively handle a large number of features. This paper address these two frontal issues for mass spectrometry (MS) classification. We apply the theory of linear predictive coding to extract features and vector quantization to reduce the storage of the large feature space of MS data. The proposed methodology was tested using two MS-based cancer datasets and the results are promising.
Multi-visualization of the Cooperative Context in Building Construction Activity A Model-Based Approach to design AEC-specific Visualization Interfaces
Authors: Sylvain Kubicki, Gilles Halin, Annie Guerriero
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Cooperation between actors in design and construction activities in architecture is an essential stake nowadays. In professional practices the actors involved in construction projects use numerous tools. The project is unique but the "views" that actors manipulate are various and sometimes fundamentally different. Their common characteristic is that they partially represent the cooperation context through a "business specific" point of view. Bat'iViews suggests to the actors a multi-view interface of the context and enables to navigate through the different views. This proposition is based on a model-driven approach. We distinguish between "context modelling" and modelling of concepts represented in each "business-view". A model integrative infrastructure allows us to develop the prototype and to manage user interaction through the definition of models' transformations.
Using computer network simulation tools as supplements to computer network curriculum
Authors: N. Al-Holou
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Computer network technologies have been growing explosively. Teaching computer networking principles can be enhanced using simulation through the use of interactive (not statistical based) simulation. The curriculum is based on the theory that through networking simulation programs, students are able to graphically implement the concepts learned in their coursework. With networking simulation tools, students can construct, tune, and analyze network performance while reinforcing their understanding of networking theory. Network simulation tools save money by offering the user a tool to enhance the design and integration of networks. There are many network simulation tools that allow users to model LANs, MANs, and WANs on the market. This paper describes our approach to develop a computer network laboratory that enhances the understanding of a computer network course. Different computer network simulation tools have been considered and COMNET III has been selected as the tool of choice. Five labs have been developed. COMNET III is a network simulation tool that allows students and networking professionals to model, tune, and analyze the performance of various types of networks. It fosters a building-block approach by utilizing a GUI interface that is comprised of "blocks " or objects representing many of the objects used in real networks. The user has the ability to adjust the objects' parameters using either default, constant, or algebraic values to better model the objects' functions.
Overdrive Controllers for Distributed Scientific Computation
Authors: Justin M. Wozniak
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Large distributed computer systems have been successfully employed to solve modern scientific problems that were previously impracticable. Tools exist to bind together notably underutilized high speed computers and sizable storage resources, creating architectures that provide performance and capacity that scales with the quantity of resources invested. In various forms such as Internet computing, desktop grids, and even "big iron" grids, users and administrators find it difficult, however, to obtain aggregate systems that are more reliable than their underlying components and simple to utilize in concert. In this work, we will propose a model for controlling complex distributed systems and its application to the construction of scientific repositories.
A novel multirate adaptive FIR filtering algorithm and structure
Authors: Cheng-Shing Wu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

A new class of FIR filtering algorithms and VLSI architectures based on the multirate approach were recently proposed. They not only reduce the computational complexity in FIR filtering, but also retain attractive implementation-related properties such as regularity and multiply-and-accumulate structure. In addition, the multirate feature can be applied to low-power/high-speed VLSI implementation. These properties make the multirate FIR filtering very attractive in many DSP and communication applications. In this paper, we propose a novel adaptive filter based on this new class of multirate FIR filtering structures. The proposed adaptive filter inherits the advantages of the multirate structures such as low computational complexity and low-power/high-speed applications. Moreover, the multirate feature helps to improve the convergence property of the adaptive filters.
Toward Broad-Spectrum Autonomic Management
Authors: Edmund Smith, Paul Anderson
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The fields of autonomics and system configuration share a common goal in decreasing the cost of ownership of large fabrics. In this paper we present a combined vision in which the technical advances of autonomics and the usability advances of system configuration are merged. We present some early system configuration research that forms the first steps toward this vision. Computer fabrics are becoming ever more complex and ever more central to the operation of organisations. The cost of a single fabric failure can easily dwarf the cost of employing its administrators [1] but, as for software developers before them [2], IT managers are discovering that simply adding more people to a complex problem does not necessarily provide better results. Autonomics has as its origin the attempt to improve the robustness of an infrastructure by enabling the fabric itself to respond to changes in its environment [3]. But how can we be sure that the the large-scale properties of the fabric will be maintained as it attempts to heal itself? Allowing the fabric to modify itself and evolve its own solutions will make management more difficult, not less, unless the power of administrators to understand and control their fabric is not also increased. The authors' background is not in autonomics, but in system configuration [4], the study of correctly, accurately and scalably building and maintaining computer fabrics. In this paper we present our vision of an autonomic fabric, a fabric which can recover from many errors without human intervention, yet never be beyond the control or understanding of its administrators. This, we believe, will be a fabric which is affordable, both in terms of the effort needed to maintain it and in terms of its support for critical applications.
Phase linearity in polyphase filters
Authors: O. Ekiz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Polyphase structures composed of recursive filters as subsections can be made to have either approximately linear or nonlinear phase response depending on the requirements of the application. There are several ways to obtain approximately linear phase filters. In this paper, we are concerned with the phase deviation from linearity in polyphase filters composed of infinite impulse response allpass sections. A linear relationship is presented between the number of delay sections per branch and the phase deviation from linearity which allows the designer to know how many nonzero sections are needed per branch in order to obtain a certain deviation from linearity beforehand.