ppxscal/embedding_network huggingface dataset:
Java bytecode verification for secure information flow
Authors: Marco Avvenuti, Cinzia Bernardeschi, Nicoletta De Francesco
Venue: ACM SIGPLAN Notices (2003)

Security of Java programs is important as they can be executed in different platforms. This paper addresses the problem of secure information flow for Java bytecode. In information flow analysis one wishes to check if high security data can ever propagate to low security observers. We propose a static analysis similar to the type-level abstract interpretation used for standard bytecode verification. Instead of types, our technique works with secrecy levels assigned to classes, methods' parameters and returned values, and handles implicit information flows. A verification tool based on the proposed technique is under development. Using the tool, programs downloaded from untrusted hosts can be checked locally prior to executing them.
A Hybrid Control Design for QoS Management
Authors: Sherif Abdelwahed, Sandeep Neema, Joseph Loyall, Richard Shapiro
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

In this paper we present an approach for QoS managementthat can be applied to a general class of real-time distributedcomputation systems. In the proposed approach aswitching hybrid system model is used to represent the system.In this setting, the QoS specifications are transformedinto set-point specifications and a limited-horizon onlinesupervisory controller is used to move the system to the optimaloperation point.
Factors correlating with teachers' use of computers in the classroom
Authors: Christopher Murray
Venue:  (2003)

This study examined several factors relating to the use of computers in the classroom by teachers. The factors examined in this study included teacher attitudes, emotions, beliefs and outside influences. This was done by a review of past studies, administering two surveys (demographics questionnaire and Computer Attitude Scale) and analyzing the survey data. Questionnaires were distributed to faculty at five randomly selected schools in the Chicagoland area participating in the study. Data from the surveys were then examined by principle components analysis, multiple correlation and multiple regression analyses to determine which factors correlate with teacher computer use in the classroom. This study found that a greater amount of computer experience fostered more positive attitudes towards computers. Teachers with greater years of computer experience were more comfortable with computers. The study also found that usefulness is correlated with grade level taught, teaching experience and classroom use and that computer liking is correlated with grade level taught and teaching experience. The main goal of this study was to examine the relationship between teachers' attitudes, emotions, beliefs, outside influences and teachers use of computers. The results should help administrators and teachers understand why faculty embrace or resist technology. The findings suggest that training professionals should consider many of the correlations between factors found in this study when designing professional development programs for teachers.
Solution of a module orientation and rotation problem
Authors: Xianjin Yao, C. L. Liu
Venue: Proceedings of the conference on European design automation (1990)

We study in this paper a module orientation and rotation problem. We assume that a set of rectangular modules has been placed according to proximity requirements while we still have the freedom to choose the orientation of the modules, to rotate the modules, and to shift the pins along the boundary of each module. We propose a fast heuristic algorithm to solve the problem, minimizing the total length of the connecting wires. Our algorithm produces very good experimental results in no more than two minutes to computation time for problems with hundreds and even thousands of modules.
Preventing Crosstalk Delay using Fibonacci Representation
Authors: Madhu Mutyam
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

As the CMOS technology scaled down to deep sub-micronlevel, the crosstalk effects due to the coupling capacitancebetween interconnection lines has become one of themain performance limiting factors. Several methods suchas those based on routing strategies, skewing the timing ofsignals on adjacent wires, interleaving mutually exclusivebuses, precharging the bus, and bus encoding technique,have been proposed to eliminate/reduce the crosstalk delay.In this work, we propose a bus encoding technique usinga variant of binary Fibonacci representation to preventcrosstalk delay and give a recursive procedure to generatecrosstalk delay free binary Fibonacci codewords. We showthat m-bit crosstalk delay free binary Fibonacci codewordsare used to encode [log2(Fm+2)]-bit bus, where Fm+2 is the (m + 2)th Fibonacci number.So, a 32-bit bus can beencoded using 46-bit crosstalk delay free binary Fibonaccicodewords.
Architecture to support dynamic composition of math lesson plans
Authors: M. Kellar, B. MacKay, R. Zhang, C. Watters, D. Kaufman, J. Borwein
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

In this work we describe an architeture that supports the composition of web based lesson plans for math learning based on a database of fine grained mathematical components that can be tailored for communities of users. For this research, the principal target community of users is middle school mathematics teachers. Our goal is to build a web accessible resource of pedagogical material for grades K-12 math that can be used and reused in a variety of contexts from teacher remediation to lesson preparation through to student use of the lesson. The web based lessons are generated on the fly from a database of fine grained components that include explanations, interactive activities, worksheets, images, videos, audio, FAQ's, online questions and challenges.
Position calibration of audio sensors and actuators in a distributed computing platform
Authors: Vikas C. Raykar, Igor Kozintsev, Rainer Lienhart
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

In this paper, we present a novel approach to automatically determine the positions of sensors and actuators in an ad-hoc distributed network of general purpose computing platforms. The formulation and solution accounts for the limited precision in temporal synchronization among multiple platforms. The theoretical performance limit for the sensor positions is derived via the Cramer-Rao bound. We analyze the sensitivity of localization accuracy with respect to the number of sensors and actuators as well as their geometry. Extensive Monte Carlo simulation results are reported together with a discussion of the real-time system. In a test platform consisting of 4 speakers and 4 microphones, the sensors' and actuators' three dimensional locations could be estimated with an average bias of 0.08 cm and average standard deviation of 3.8 cm.
Impact on society: the missing dimension in evaluating the benefits of IT in the public sector
Authors: Ian M. Sims, Craig Standing
Venue: Managing globally with information technology (2003)

This chapter explains the need for a new dimension in the evaluation of the benefits of information technology where the technology has impact is on the broader society rather than just on the organization that implements it.In the early 1990s, when DeLone and McLean (1992) developed their framework, the benefits described were intra-organizational. A decade later, many major IT systems directly impact on the society within which they function. This is the especially true of systems designed to provide the interface between government and the private sector. Additionally, the procurement environment is increasingly becoming more complex for practitioners with new e-marketplace developments.This case illustrates specific peculiarities and constraints on public sector use of e-marketplaces. It provides an evaluation framework that can be used by public sector organizations when examining the adoption and evaluation of e-marketplace procurement that emphasizes the experimental nature of many e-commerce related projects.
An Empirical Study on Testing and Fault Tolerance for Software Reliability Engineering
Authors: Michael R. Lyu, Zubin Huang, Sam K. S. Sze, Xia Cai
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Software testing and software fault tolerance are twomajor techniques for developing reliable softwaresystems, yet limited empirical data are available in theliterature to evaluate their effectiveness. We conducted amajor experiment to engage 34 programming teams toindependently develop multiple software versions for anindustry-scale critical flight application, and collectedfaults detected in these program versions. To evaluatethe effectiveness of software testing and software faulttolerance, mutants were created by injecting real faultsoccurred in the development stage. The nature,manifestation, detection, and correlation of these faultswere carefully investigated. The results show thatcoverage testing is generally an effective mean todetecting software faults, but the effectiveness of testingcoverage is not equivalent to that of mutation coverage,which is a more truthful indicator of testing quality. Wealso found that exact faults found among versions arevery limited. This result supports software fault toleranceby design diversity as a creditable approach for softwarereliability engineering. Finally we conducted domainanalysis approach for test case generation, andconcluded that it is a promising technique for softwaretesting purpose.
Web100: extended TCP instrumentation for research, education and diagnosis
Authors: Matt Mathis, John Heffner, Raghu Reddy
Venue: ACM SIGCOMM Computer Communication Review (2003)

TCP has become the dominant protocol for all network data transport because it presents a simple uniform data delivery service which is sufficient for most applications over all types of lower network layers. By its very nature, TCP's adaption and retransmission strategies hide all of the details of the lower layers from the application. For example the only symptom of spurious packet loss (or nearly any other network problem) is longer elapsed time and lower performance.This information hiding is fundamentally important to the growth of the Internet because it decouples the evolution of applications from the evolution of link layers. However it also hides valuable information from researchers, educators, network administrators, and other people who would benefit from insight into the inner workings of TCP and the lower layers.In this paper, we present an architecture and infrastructure that provides for per-connection TCP instrumentation to expose otherwise hidden protocol events. We show examples how the infrastructure can be used in support of research, education and advanced network diagnostic tools.Our work was motivated by the observation that since about 1985 network data rates for typical novice network users have fallen by about three orders of magnitude behind expert users (who have kept up with Moore's Law). We use the term "Wizard Gap" to describe this phenomenon. The Web100 and Net100 projects were formed as one step in closing the Wizard Gap.
Exploration of functional sites in complex rna folds and macromolecular assemblies
Authors: Diosdado Rey Banatao
Venue:  (2003)

Structural genomics efforts enable the high-throughput discovery of novel molecular structures and are quickly outpacing traditional biochemical methods for determining the function of those molecules. This flood of structural data has created the need for rapid and automated ways to annotate function to molecular structures. Additionally, the interest in RNA structure and function has increased rapidly within the past several years, as dramatic discoveries have been made about novel biological mechanisms directly involving RNA. The folding, structure, and function of all RNA molecules are dependent on the direct and indirect coordination of magnesium (Mg2+) ions. However, locating Mg2+ binding sites is difficult experimentally and computationally. Thus, in my doctoral research, I have created and applied computational tools to address issues in the identification of functional sites in RNA structures and assemblies. I developed a novel approach, based on a previous method of identifying functional sites in protein structures, for understanding and locating Mg2+ binding sites in RNA. I have developed additional tools for the integrated analysis and visualization of my results with RNA structure. I have also contributed to the development of a generally applicable tool for knowledge modeling and structural modeling of the ribosome, the large assembly of RNA and proteins responsible for protein synthesis in the cell. I have successfully validated this approach on experimentally characterized RNA systems and have demonstrated that it is scalable to the analysis of large RNA assemblies. Most importantly, I have identified novel Mg2+ binding sites that may have important functional roles in RNA catalysis, especially in ribosomal activity. I provided detailed descriptions of these sites that may guide experimentalists in the comprehensive analysis of Mg2+ binding in RNA and the ribosome. My methods and discoveries may serve as tools for rational drug design targeting RNA and its assemblies.
Introduction to Special Issue: Intersection types-new insights
Authors: Mariangiola Dezani-Ciancaglini, Simona Ronchi Della Rocca
Venue: Mathematical Structures in Computer Science (2003)

The intersection-types discipline for &lambda;-calculus was introduced in Coppo and Dezani-Ciancaglini (1980) as an extension of Curry's type assignment system. The motivation was essentially to increase the class of terms possessing types. Indeed, it turned out that this discipline can assign types to all and only the strongly normalising terms. This is largely a folklore result; the first published proof appears in Pottinger (1980). Subsequently, the intersection-types discipline was used in Barendregt et al. (1983) as a tool for proving Scott's conjecture concerning the completeness of the set-theoretic semantics for simple types.
PARAGON: a new package for gate matrix layout synthesis
Authors: R. Burgess, C. Wouters
Venue: Proceedings of the conference on European design automation (1990)

Gate matrix is a layout style for implementing logic in integrated MOS circuits. In this paper we discuss algorithms used in a newly developed software package called PARAGON which generates near-optimal gate matrix geometric layouts given a set of logic expressions. New features include individual sizes of transistors being taken into account at all stages of the algorithms and the use of transistor orientations to reduce the width and improve the timing performance of the gate matrix layouts. The optimisation of a gate matrix is achieved by optimising firstly its height and secondly its width. The height is optimised by the column assignment algorithm and the width is optimised by the merging, track assignment and transistor orientation algorithms. Once optimisation has been completed, a new detailed routing algorithm is performed. Although the emphasis is on the minimisation of the total area, the optimisation of the timing behaviour is also included in our algorithms.
Enabling the Co-Allocation of Grid Data Transfers
Authors: Sudharshan Vazhkudai
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

Data-sharing scientific communities use storage systems asdistributed data stores by replicating content. In such highlyreplicated environments, a particular dataset can reside atmultiple locations and can thus be downloaded from any oneof them. Since datasets of interest are significantly large insize, improving download speeds either by server selection orby co-allocation can offer substantial benefits.In this paper, we present an architecture for co-allocatingGrid data transfers across multiple connections, enabling theparallel download of datasets from multiple servers. We havedeveloped several co-allocation strategies comprising ofsimple brute-force, history-based and dynamic load balancingtechniques as a means both to exploit rate differences amongthe various client-server links and to address dynamic ratefluctuations. We evaluate our approaches using the GridFTPdata movement protocol in a wide-area testbed and presentour results.
Speech Act Pro.ling: A Probabilistic Method for Analyzing Persistent Conversations and Their Participants
Authors: Douglas P. Twitchell, Jay F. Nunamaker,  Jr.
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

The increase in persistent conversations in the form of chat and instant messaging (IM) has presented new opportunities for researchers. This paper describes a method for evaluating and visualizing persistent conversations by creating a speech act pro.le for conversation participants using speech act theory and concepts from fuzzy logic. This method can be used either to score a participant based on possible intentions or to create a visual map of those intentions. Transcripts from the Switchboard corpus, which have been marked up with speech act labels according to a SWBD-DAMSL tag set of 42 tags, are used to train language models and a modi.ed hidden Markov model (HMM) to obtain probabilities for each speech act type for a given sentence. Rather than choosing the speech act with the maximum probability and assigning it to the sentence, the probabilities are aggregated for each conversation participantcreating a set of speech act pro.les, which can be visualized as a radar graphs. Several example profiles are shown along with possible interpretations. The profiles can be used as an overall picture of a conversation, and may be useful in various analyses of persistent conversations including information retrieval, deception detection, and online technical support monitoring.
iGrocer: a ubiquitous and pervasive smart grocery shopping system
Authors: Sangeetha Shekar, Prashant Nair, Abdelsalam (Sumi) Helal
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Emerging Smart phones are poised to give a whole new dimension to the way we shop, bank, and go about many of our everyday activities. iGrocer is a smart grocery shopping assistant, that re-defines grocery shopping. It is capable of maintaining nutrition profiles of its users. Particularly useful for elders and disabled shoppers, iGrocer can aid and advice users on what products to buy and what to avoid based on nutrition criteria and price constraints. Implemented on a smart phone with a barcode scanner accessory, iGrocer has a number of killer features that include: (1) ubiquitous shopping list: adding items to the shopping list by different means (e.g. simply scanning them when near empty, scanning and storing manufacturer coupons, planning the weekly menu right on the phone or through the web, and shopping for the necessary ingredient of a particular recipe, (2) quick and assisted in-store shopping: while shopping in the grocery store, iGrocer maps out the shortest shopping path with a map indicating the location of the next item on the list, and (3)automated check-out: iGrocer is capable of acting on behalf of the store and the customer to perform a trusted queue-less checkout. In this "application-oriented" paper, we present the iGrocer concept and give details of its architecture and implementation. We also summarize the lessons learnt throughout its development and testing phases.
Isosurface generation by using extrema graphs
Authors: Takayuki ITOH, Koji KOYAMADA
Venue: Proceedings of the conference on Visualization '94 (1994)

A high-performance algorithm for generating isosurfaces is presented. In this algorithm, extrema points in a scalar field are first extracted. A graph is then generated in which the extrema points are taken as nodes. Each arc of the graph has a list of IDs of the cells that are intersected by the arc. A boundary cell list ordered according to cells' values is also generated. The graph and the list generated in this pre-process are used as a guide in searching for seed cells. Isosurfaces are generated from seed cells that are found in arcs of the graph. In this process isosurfaces appear to propagate themselves. The algorithm visits only cells that are intersected by an isosurface and cells whose IDs are included in cell lists. It is especially efficient when many isosurfaces are interactively generated in a huge volume. Some benchmark tests described in this paper show the efficiency of the algorithm.
reality: a scalable intelligent travel planner
Authors: Marc Torrens, Patrick Hertzog, Loic Samson, Boi Faltings
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Many information systems are used in a problem solving context. Examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. They can be made more useful by integrating problem-solving capabilities into the information systems. This poses the challenge of scalability: when hundreds of users access a server at the same time, it is important to avoid excessive computational load.In this paper, we present an approach, called reality, that allows to significantly extend the reach of electronic commerce in travel. Our application addresses in particular the challenge of modeling customers' personal preferences and providing solutions that are tailored to just those preferences. In contrast to existing technology, which allow to optimize only a small and predefined set of preferences, our tool allows a wide variety that can accurately model the preferences of different customers.
Trends in transforming scholarly communication and their implications
Authors: Ziming Liu
Venue: Information Processing and Management: an International Journal (2003)

Scholarly communication is undergoing transformation under the confluence of many forces. The purpose of this article is to explore trends in transforming scholarly publishing and their implications. It examines how collaboration and volume of information production were changed over the past century. It also explores how older documents are used under today's network environment where new information is easily accessible. Understanding these trends would help us design more effective electronic scholarly publishing systems and digital libraries, and serve the needs of scholars more responsively.
An investigation of framing and scaling as confounding variables in information outcomes: the case of technophobia
Authors: Appa Rao Korukonda, Seth Finn
Venue: Information Sciences: an International Journal (2003)

Technophobia has been an enduring problem in industrial economies over the last 20 years. Though explanatory models have been proposed to explain the prevalence of technophobia, these efforts have been diffuse, contradictory, and lacking in integration and explanatory and predictive utility. Using technophobia as the background variable, this research examines the role of scaling and framing in organizational research. It is argued that these particular issues, though endemic to research in other areas of social sciences as well, are worthy of exploration in the context of technophobia particularly in light of contradictory findings.