ppxscal/embedding_network huggingface dataset:
Missouri public school principals' computer usage and conformity to technology standards
Authors: Gary Gene Ury
Venue:  (2003)

The purpose of this study was to develop a valid and reliable survey that could be used to determine the level of computer usage and performance to National Education Technology Standards for Administrators (NETS*A) by public school principals. Additionally, the study provided data concerning trends and differences between computer usage, performance to NETS*A, and the independent variables of gender, school size, school level, years as a principal, years in K&ndash;12 education, and Missouri Technology Leadership Academy (MTLA) attendance. The findings supported the Survey of Technology Standards for School Administrators (STSSA) as a valid and reliable instrument. Factor analysis allowed the reduction of items from the original 29 dependent variables to 16 dependent variables. The 16 items were combined into the five super variables of Advanced computer usage, Internet computer usage, Leadership standards, Productivity standards, and Social/ethical standards. Significant differences were found among and between the super variables and the independent variables. The findings led to the formation of the following conclusions. The STSSA in its original form or the new shortened form can reliably collect responses from public school principals about their perceived use of computers and performance to NETS*A produced by the International Society for Technology Education (ISTE). The NETS*A are equally applicable to male and female public school principals from large and small schools across all levels of K&ndash;12 education. However, some of the NETS*A may apply to public school administration at levels other than building principal. ISTE should expand this study to determine if some realignment of standards is necessary or if the findings of this study were peculiar to Missouri public school principals. The study demonstrated that principals can show significant performance to NETS*A regardless of their reported level of computer usage. MTLA attendance increased the reported performance to Advanced computer usage, Internet computer usage, and Social/ethical standards. Indications were that MTLA should increase efforts in the areas of leadership and productivity standards.
On polynomial complexity of a stochastic algorithm for mixed zero-one programs
Authors: Raj Jagannathan
Venue: Discrete Applied Mathematics (2004)

A stochastic (randomization) algorithm for solving mixed zero-one programs in a yes-no form is presented. Under a set of conditions, we show that any mixed zero-one program is such that either a feasible solution for the problem is obtained or it is classified as infeasible. The algorithm is such that its random running time has its kth moment, k = 1,...,j, for any j, bounded by a polynomial in n, the number of zero-one variables.
A new adaptive penalty scheme for genetic algorithms
Authors: Helio J. C. Barbosa, Afonso C. C. Lemonge
Venue: Information Sciences: an International Journal (2003)

A parameter-less adaptive penalty scheme for genetic algorithms applied to constrained optimization problems is proposed. The performance of this new scheme is examined using test problems from the evolutionary computation literature as well as structural engineering constrained optimization problems.
Link mining: a new data mining challenge
Authors: Lise Getoor
Venue: ACM SIGKDD Explorations Newsletter (2003)

A key challenge for data mining is tackling the problem of mining richly structured datasets, where the objects are linked in some way. Links among the objects may demonstrate certain patterns, which can be helpful for many data mining tasks and are usually hard to capture with traditional statistical models. Recently there has been a surge of interest in this area, fueled largely by interest in web and hypertext mining, but also by interest in mining social networks, security and law enforcement data, bibliographic citations and epidemiological records.
Technology literacy issues for freshmen education majors in a leading teacher program
Authors: David D. Carbonara
Venue: Current issues in IT education (2003)

In this chapter, the literacy issues of a preservice leading teacher education program are discussed. The leading teacher program is constructed on the foundation of the three major themes of leadership, diversity, and technology. The technology theme ensures that the preservice teacher is cognizant of information literacy issues and instructional technology principles and practices. The student is well-prepared to become a leading teacher in the nation's schools, where he or she is entrusted to prepare a citizenry that will communicate and collaborate to solve complex problems in the new millennium.
Spidering Hacks
Authors: Kevin Hemenway, Tara Calishain
Venue:  (2003)

Written for developers, researchers, technical assistants, librarians, and power users, Spidering Hacks provides expert tips on spidering and scraping methodologies. You'll begin with a crash course in spidering concepts, tools (Perl, LWP, out-of-the-box utilities), and ethics (how to know when you've gone too far: what's acceptable and unacceptable). Next, you'll collect media files and data from databases. Then you'll learn how to interpret and understand the data, repurpose it for use in other applications, and even build authorized interfaces to integrate the data into your own content.
Branching time and orthogonal bisimulation equivalence
Authors: Jan A. Bergstra, Alban Ponse, Mark B. van der Zwaag
Venue: Theoretical Computer Science (2003)

We propose a refinement of branching bisimulation equivalence that we call orthogonal bisimulation equivalence. Typically, internal activity (the performance of τ-steps) may be compressed, but not completely discarded. Hence, a process with τ-steps cannot be equivalent to one without τ-steps. Also, we present a modal characterization of orthogonal bisimulation equivalence. This equivalence is a congruence for ACP extended with abstraction and priority operators. We provide a complete axiomatization, and describe some expressiveness results. Finally, we present the verification of a PAR protocol that is specified with use of priorities.
Design and Implementation of a Wireless Prescription System
Authors: Sherali Zeadally, Junhua Pan
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

We explore by design and implementation the applicability of J2EE (Java 2 Platform, Enterprise Edition) architecture in supporting wireless services as well as Web-based services. This has been demonstrated by implementing a wireless prescription system, which provides wireless services to physicians, and Web-based services to pharmacies and administrators. The goal of the wireless prescription system is to improve the efficiency of the healthcare system by reducing the overall time and cost used to create documents and retrieve information. We also present a performance evaluation of the implemented wireless prescription system using latency as the performance metric. In particular, we investigated theoverheads associated with different components of the underlying J2EE architecture, which includes the Session Bean, Entity Bean, and the database. We found that the latency overheads introduced by these components account for 3.8% to 4.3%, 3.9% to 4.4%, and 91.8% of the total delay experienced inside the J2EE architecture respectively.
A new nanocomposite resist for low and high voltage electron beam lithography
Authors: M. Azam Ali, Kenneth E. Gonsalves, Ankur Agrawal, Augustin Jeyakumar, Clifford L. Henderson
Venue: Microelectronic Engineering (2003)

A novel nanocomposite photoresist was synthesized and characterized for use in both low and high voltage electron beam lithography. This resist system is shown to display the ideal combination of both enhanced etch resistance and enhanced sensitivity required to satisfy both low and high voltage patterning applications. Resist sensitivity was enhanced by the direct incorporation of a photoacid generating monomer into the resist polymer backbone while the etch resistance of the material was improved by copolymerization with a POSS containing monomer.
A visual interface technique for exploring OLAP data with coordinated dimension hierarchies
Authors: Mark Sifer
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Multi-dimensional data occurs in many domains while a wide variety of text based and visual interfaces for querying such data exists. But many of these interfaces are not applicable to OLAP, as they do not support use of dimension hierarchies for selection and aggregation. We introduce an interface technique which supports visual querying of OLAP data, that has been implemented in the SGViewer tool. It is based on a data graph rather than a data cube representation of the data. Our interface presents each dimension hierarchy in a zoomable panel which supports selection and aggregation at multiple levels. Users explore data and query it by making selections in several dimension views. Three view coordinations are identified; progressive, global and result only. Our main contribution, the progressive view coordination provides better support for query refinement than existing interfaces, by helping users decide the next query step with intermediate result overviews, and by helping users change a previous selection decision with retained selection context views. Our interface technique is demonstrated with a web log dataset of visits organised into time, download, visitor and referrer address dimensions.
A conjunctive type system for useless-code elimination
Authors: Ferruccio Damiani
Venue: Mathematical Structures in Computer Science (2003)

We investigate the use of conjunctive non-standard type inference for the elimination of useless code in higher-order typed functional programs. In particular, we present a non-standard type assignment system for detecting useless code together with a mapping that simplifies a program by removing the useless code detected using the system.
An adaptive nearest neighbor search for a parts acquisition ePortal
Authors: Rafael Alonso, Jeffrey A. Bloom, Hua Li, Chumki Basu
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

One of the major hurdles in maintaining long-lived electronic systems is that electronic parts become obsolete, no longer available from the original suppliers. When this occurs, an engineer is tasked with resolving the problem by finding a replacement that is "as similar as possible" to the original part. The current approach involves a laborious manual search through several electronic portals and data books. The search is difficult because potential replacements may differ from the original and from each other by one or more parameters. Worse still, the cumbersome nature of this process may cause the engineers to miss appropriate solutions amid the many thousands of parts listed in industry catalogs.In this paper, we address this problem by introducing the notion of a parametric "distance" between electronic components. We use this distance to search a large parts data set and recommend likely replacements. Recommendations are based on an adaptive nearest-neighbor search through the parametric data set. For each user, we learn how to scale the axes of the feature space in which the nearest neighbors are sought. This allows the system to learn each user's judgment of the phrase "as similar as possible."
Statistical Relational Learning for Document Mining
Authors: Alexandrin Popescul, Lyle H. Ungar, Steve Lawrence, David M. Pennock
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

A major obstacle to fully integrated deployment of manydata mining algorithms is the assumption that data sitsin a single table, even though most real-world databaseshave complex relational structures. We propose an integratedapproach to statistical modeling from relationaldatabases. We structure the search space based on "refinementgraphs", which are widely used in inductive logic programmingfor learning logic descriptions. The use of statisticsallows us to extend the search space to include richerset of features, including many which are not boolean.Search and model selection are integrated into a single process,allowing information criteria native to the statisticalmodel, for example logistic regression, to make feature selectiondecisions in a step-wise manner. We present experimentalresults for the task of predicting where scientific paperswill be published based on relational data taken fromCiteSeer. Our approach results in classification accuraciessuperior to those achieved when using classical "flat" features.The resulting classifier can be used to recommendwhere to publish articles.
Strategy for Verifying Security Protocols with Unbounded Message Size
Authors: Y. Chevalier, L. Vigneron
Venue: Automated Software Engineering (2004)

We present a system for automatically verifying cryptographic protocols. This system manages the knowledge of principals and checks if the protocol is runnable. In this case, it outputs a set of rewrite rules describing the protocol itself, the strategy of an intruder, and the goal to achieve. The protocol specification language permits to express commonly used descriptions of properties (authentication, short term secrecy, and so on) as well as complex data structures such as tables and hash functions. The generated rewrite rules can be used for detecting flaws with various systems: theorem proving in first-order logic, on-the-fly model-checking, or SAT-based state exploration. These three techniques are being experimented in the European Union project AVISPA.The aim of this paper is to describe the analysis process. First, we describe the major steps of the compilation process of a protocol description by our tool Casrul. Then, we describe the behavior of the intruder defined for the analysis. Our intruder is based on a lazy strategy, and is implemented as rewrite rules for the theorem prover daTac. Another advantage of our model is that it permits to handle parallel executions of the protocol and composition of keys. And for sake of completeness, it is possible, using Casrul, to either specify an unbounded number of executions or an unbounded message size.The combination of Casrul and daTac has permitted successful studying of various protocols, such as NSPK, EKE, RSA, Neumann-Stubblebine, Kao-Chow and Otway-Rees. We detail some of these examples in this paper. We are now studying the SET protocol and have already very encouraging results.
Mapping Multi-Million Gate SoCs on FPGAs: Industrial Methodology and Experience
Authors: H. Krupnova
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

Today, having a fast hardware platform for SoC software development prior to silicon is an important challenge to gain the time-to-market. The FPGAs offer an excellent prototyping basis for building hardware platforms since more than ten years ([1]). However, as the circuit complexity increases and project time-frames shrink, building a multi-FPGA prototype represents a real challenge from the complexity viewpoint. The paper describes the state-of-the-art mapping methodology, prototyping tools and flows, shows the most difficult mapping problems and the ways to overcome them. The paper is issued from the experience of mapping on FPGA platform of four latest highly complex ST Microelectronics SoCs ranging from 1.5 to 4 million real ASIC gates mapped to up to 9 highest capacity FPGAs.
Optical pH measurement using chromatic modulation
Authors: D. Tomtsis, V. Kodogiannis, E. Wadge
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

A distimulus chromatic detection system allied with fibre optic light transmission has been used in the development of a low cost and accurate pH measurement system. The performance of the chromatic pH measurement system is compared with a number of optical measurement techniques, which are based on intensity modulation. The chromatic modulation technique has been shown to have advantages over intensity modulation, such as greater immunity to fibre bending, and maintaining calibration when extending the length of the optical fibres used to address the modulator.
Efficient data access to multi-channel broadcast programs
Authors: Wai Gen Yee, Shamkant B. Navathe
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

This paper studies fast access to data that are broadcast on multiple channels. Broadcast is a useful data dissemination technique because of its scalability, but is lacking when it comes to response time. Increasing the number of available broadcast channels is a logical way of increasing throughput. Little work, however, has considered the access structures necessary for making effective use of the additional channels. We propose various indexing schemes for a multi-channel broadcast program. We demonstrate the effectiveness of our techniques in decreasing response time and tuning time via extensive experiments over a wide range of parameters.
Multimedia fliers: information sharing with digital community bulletin boards
Authors: Elizabeth F. Churchill, Les Nelson, Laurent Denoue
Venue: Communities and Technologies (2003)

Community poster boards serve an important community building function. Posted fliers advertise services, events and people's interests, and invite community members to communicate, participate, interact and transact. In this paper we describe the design, development and deployment of several large screen, digital community poster boards, the Plasma Posters, within our organization. We present our motivation, two fleldwork studies of online and offline information sharing, and design guidelines derived from our observations. After introducing the Plasma Posters and the underlying information storage and distribution infrastructure, we illustrate their use and value within our organization, summarizing findings from qualitative and quantitative evaluations. We conclude by elaborating socio-technical challenges we have faced in our design and deployment process.
CCII-Based Analog Integrated Circuit for Sliding-Mode Control of Switching Power Converters
Authors: E. Alarcón, A. Romero, A. Poveda, S. Porta, L. Martínez-Salamero
Venue: Analog Integrated Circuits and Signal Processing (2004)

The design and implementation of a CMOS analog integrated circuit that provides versatile sliding-mode control laws for high-frequency switching power converters is described. The controller circuit implements general-purpose linear-surface state control laws incorporating compensating dynamics. The analog controller integrated circuit considers current-mode circuit techniques, hence exhibiting good performance as far as operation speed, power consumption, suitability to poorly regulated power supplies and robustness in front of interferences are concerned. Compared to previous designs, the circuit allows the extension of switching frequency operating margin in more than one decade. The circuit allows modular connection, being composed of externally linearized transconductors based on current conveyors, current-mode amplifiers and filtering stages, and a transimpedance high-speed hysteretic comparator. Full-transistor-level post-layout simulations for a CMOS 0.8 &mu;m technology and experimental results validate the high-speed functionality of the proposed sliding-mode controller ASIC implementation. The circuit may be used either as a standalone IC controller or as controller circuit that is technology-compatible with on-chip switching power converters and on-chip loads for future powered Systems on Chip.
Aurora: a new model and architecture for data stream management
Authors: Daniel J. Abadi, Don Carney, Ugur Çetintemel, Mitch Cherniack, Christian Convey, Sangdon Lee, Michael Stonebraker, Nesime Tatbul, Stan Zdonik
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2003)

Abstract.This paper describes the basic processing model and architecture of Aurora, a new system to manage data streams for monitoring applications. Monitoring applications differ substantially from conventional business data processing. The fact that a software system must process and react to continual inputs from many sources (e.g., sensors) rather than from human operators requires one to rethink the fundamental architecture of a DBMS for this application area. In this paper, we present Aurora, a new DBMS currently under construction at Brandeis University, Brown University, and M.I.T. We first provide an overview of the basic Aurora model and architecture and then describe in detail a stream-oriented set of operators.
Flexible Compiler-Managed L0 Buffers for Clustered VLIW Processors
Authors: Enric Gibert, Jesús Sánchez, Antonio González
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Wire delays are a major concern for current and forthcoming processors.One approach to attack this problem is to divide the processorinto semi-independent units referred to as clusters. Acluster usually consists of a local register file and a subset of thefunctional units, while the data cache remains centralized. However,as technology evolves, the latency of such a centralizedcache will increase leading to an important performance impact.In this paper we propose to include flexible low-latency buffers ineach cluster in order to reduce the performance impact of highercache latencies. The reduced number of entries in each buffer permitsthe design of flexible ways to map data from L1 to these buffers.The proposed L0 buffers are managed by the compiler, whichis responsible to decide which memory instructions make use ofthem.Effective instruction scheduling techniques are proposed togenerate code that exploits these buffers. Results for the Media-benchbenchmark suite show that the performance of a clusteredVLIW processor with a unified L1 data cache is improved by 16%when such buffers are used. In addition, the proposed architecturealso shows significant advantages over both MultiVLIW processorsand a clustered processors with a word-interleaved cache,two state-of-the-art designs with a distributed L1 data cache.
Count models for software quality estimation
Authors: Taghi M. Khoshgoftaar
Venue:  (2003)

The primary aim of software engineering is to produce quality software that is delivered on time, within budget, and fulfils all its requirements. A timely estimation of software quality can serve as a prerequisite in achieving high reliability of software-based systems. More specifically, software quality assurance efforts can be prioritized for targeting program modules that are most likely to have a high number of faults. Software quality estimation models are generally of two types: a classification model that predicts the class membership of modules into two or more quality-based classes, and a quantitative prediction model that estimates the number of faults (or some other software quality factor) that are likely to occur in software modules. In the literature, a variety of techniques have been developed for software quality estimation, most of which are suited for either prediction or classification but not for both, e.g., the multiple linear regression (only for prediction) and logistic regression (only for classification).