ppxscal/embedding_network huggingface dataset:
Computability distilled
Authors: Eric Shade
Venue: Journal of Computing Sciences in Colleges (2003)

In the ACM/IEEE 2001 curriculum guidelines, computability and its limitations are required topics, but Turing machines are not. However, most undergraduate textbooks that cover computability base their discussion on Turing machines, so in practice it is difficult to cover the required material on computability without also including elective material on Turing machines. This paper provides simple, classroom-tested techniques for teaching computability rigorously without reference to Turing machines or other theoretical topics. Even instructors who choose to include elective material on automata theory are likely to find this presentation simpler and more intuitive than traditional ones.
A rule-based video database system architecture
Authors: Mehmet Emin Dönderler, Özgür Ulusoy, Uǧur Güdükbay
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

We propose a novel architecture for a video database system incorporating both spatio-temporal and semantic (keyword, event/activity and category-based) query facilities. The originality of our approach stems from the fact that we intend to provide full support for spatio-temporal, relative object-motion and similarity-based objecttrajectory queries by a rule-based system utilizing a knowledge-base while using an object-relational database to answer semantic-based queries. Our method of extracting and modeling spatio-temporal relations is also a unique one such that we segment video clips into shots using spatial relationships between objects in video frames rather than applying a traditional scene detection algorithm. The technique we use is simple, yet novel and powerful in terms of effectiveness and user query satisfaction: video clips are segmented into shots whenever the current set of relations between objects changes and the video frames, where these changes occur, are chosen as keyframes. The directional, topological and third-dimension relations used for shots are those of the keyframes selected to represent the shots and this information is kept, along with frame numbers of the keyframes, in a knowledge-base as Prolog facts. The system has a comprehensive set of inference rules to reduce the number of facts stored in the knowledge-base because a considerable number of facts, which otherwise would have to be stored explicitly, can be derived by rules with some extra effort.
ICENI: optimisation of component applications within a Grid environment
Authors: Nathalie Furmento, Anthony Mayer, Stephen McGough, Steven Newhouse, Tony Field, John Darlington
Venue: Parallel Computing (2002)

Effective exploitation of Computational Grids can only be achieved when applications are fully integrated with the Grid middleware and the underlying computational resources. Fundamental to this exploitation is information. Information about the structure and behaviour of the application, the capability of the computational and networking resources, and the availability and access to these resources by an individual, a group or an organisation.In this paper we describe Imperial College e-Science Networked Infrastructure (ICENI), a Grid middleware framework developed within the London e-Science Centre. ICENI is a platform-independent framework that uses open and extensible XML derived protocols, within a framework built using Java and Jini, to explore effective application execution upon distributed federated resources. We match a high-level application specification, defined as a network of components, to an optimal combination of the currently available component implementations within our Grid environment, by using composite performance models. We demonstrate the effectiveness of this architecture through the high-level specification and solution of a set of linear equations by automatic and selection of optimal resources and implementations.
Random elements in effective topological spaces with measure
Authors: Peter Hertling, Klaus Weihrauch
Venue: Information and Computation (2003)

Following a suggestion of Zvonkin and Levin, we generalize Martin-Löf's definition of infinite random sequences over a finite alphabet via randomness tests to effective topological spaces with a measure. We show that under weak computability conditions there is a universal randomness test. We prove a theorem on randomness preserving functions which corrects and extends a result by Schnorr and apply it to a number of examples. In particular, we show that a real number is random if, and only if, it has a random b- ary representation, for any b ≥ 2. We show that many computable, continuously differentiable real functions preserve randomness. Especially, all computable analytic functions which are not constant on any open subset of their domain preserve randomness. Finally, we introduce a new randomness concept for subsets of natural numbers, which we characterize in terms of random sequences. Surprisingly, it turns out that there are infinite co-r.e. random sets.
Selling to the Newsvendor: An Analysis of Price-Only Contracts
Authors: Martin A. Lariviere, Evan L. Porteus
Venue: Manufacturing Service Operations Management (2001)

We consider a simple supply-chain contract in which a manufacturer sells to a retailer facing a newsvendor problem and the lone contract parameter is a wholesale price. We develop a mild restriction satisfied by many common distributions that assures that the manufacturer's problem is readily amenable to analysis. The manufacturer's profit and sales quantity increase with market size, but the resulting wholesale price depends on how the market grows. For the cases we consider, we identify relative variability (i.e., the coefficient of variation) as key: As relative variability decreases, the retailer's price sensitivity decreases, the wholesale price increases, the decentralized system becomes more efficient (i.e., captures a greater share of potential profit), and the manufacturer's share of realized profit increases. Decreasing relative variability, however, may leave the retailer severely disadvantaged as the higher wholesale price reduces his profitability. We explore factors that may lead the manufacturer to set a wholesale price below that which would maximize her profit, concentrating on retailer participation in forecasting and retailer power. As these and other considerations can result in a wholesale price below what we initially suggest, our base model represents a worst-case analysis of supply-chain performance.
Stigler's Diet Problem Revisited
Authors: Susan Garner Garille, Saul I. Gass
Venue: Operations Research (2001)

We review Stigler's diet problem, its impact on linear programming and operations research, and we determine minimum cost diets using updated nutritional and cost data. We also discuss how Stigler's diet problem formulation and its extensions have, over the years, influenced dietitians and nutritionists in their search for more wholesome but cost-effective diets.
A transparent Linux super page kernel for Alpha, Sparc64 and IA32: reducing TLB misses of applications
Authors: Naohiko Shimizu, Ken Takatori
Venue: ACM SIGARCH Computer Architecture News (2003)

Modern processors have various features for latency tolerance such as Hit-under-miss, Out-of-order execution, or Multi-threading. However, many processors must make a precise trap for a TLB miss, because they maintain the TLB with software and cannot distinguish the TLB scarcity from the page fault. It is very important for the application and/or the operating system to avoid the TLB misses as much as possible. Many processors have some super page features that extend the coverage of the TLB significantly, but few operating systems support it. In this paper, we present our implementation of Super Page Kernel for the Linux operating system along with its performance. We implemented Super Page for Alpha, Sparc64 and IA32. With super page kernel, a matrix transpose program runs at least 4 times faster on Alpha, at least 2 times faster on Sparc64, and generates interesting results on IA32 compared to the normal Linux kernel. In addition, we got SPEC CPU numbers that were about 10% higher than normal kernel on Alpha.
Filtering and Searching Vector Quantization
Authors: Shih-Yu Huang
Venue: Journal of VLSI Signal Processing Systems (2003)

Under the consideration of computational complexity and design regularity, in this paper, a FASVQ (filtering and searching vector quantization) is presented to compress images. FASVQ utilizes a heuristic to filter codevectors with small costs and then employs full-search VQ within the surviving codevectors. We have proven that the proposed heuristic can easily be implemented by a table lookup technique and over 95% codevectors can be filtered. Although, the quantized codevector of FASVQ wouldn't be optimal, the experimental results show that the PSNR degradation between full-search VQ and FASVQ is only 0.24 dB on the average.
Integrating Workflow and Groupware Functionalities for Co-operating Small and Medium Sized Enterprises: A Case Study
Authors: Gábor Nagypál, Florian Fischer, Udo Straub, Peter Weiß, Ralf Nikolai
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: Recently the concept of virtual enterprises has become very popular, as this organisational form seems to fit well to the turbulent global economic environment of present days. As a virtual enterprise consists of independent members, efficient collaboration among them is crucial to the proper functioning of this business formation. To achieve this level of collaboration both groupware and workflow functionality are needed at the multi-organisational level. In this paper, we describe our solution for groupware and workflow integration which fulfills the special needs of virtual enterprises made up of small and medium sized enterprises. Our starting point is a multi-organisational groupware solution, based upon which we provide additional multi-organisational workflow functionality. We follow WfMC and W3C standards whenever possible through-out the project.
Identifying and Structuring Values to Guide Integrated Resource Planning at Bc Gas
Authors: Ralph L. Keeney, Timothy L. McDaniels
Venue: Operations Research (1999)

British Columbia Gas, a major utility, was required by the British Columbia Utilities Commission (BCUC) to develop an integrated resource plan that addressed multiple objectives and involved the participation of stakeholders. To assist BC Gas, we elicited values separately from most of the senior executives at BC Gas, members of the BCUC, and representatives of several stakeholder groups. Based on these values, we structured a set of objectives and associated performance measures for integrated resource planning (IRP) at BC Gas. A multistakeholder process then provided judgments about appropriate value tradeoffs among these objectives. This information was used in several ways in the IRP process. It fostered improved communication and served as a guide for designing more attractive plans and identifying future information needs. It also provided the basis for a quantitative evaluation of alternative plans and resources. Both the IRP process and the chosen integrated resource plan were reviewed by lawyers representing intervenors at a quasi-judicial hearing of the BCUC. Their concerns are informative in providing lessons for the use of the elicited values in the context of regulatory hearings.
Multiple solutions of inhomogeneous H-systems with zero Dirichlet boundary conditions
Authors: Futoshi Takahashi
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

In this paper, we study the existence of multiple solutions to the Dirichlet problem of the inhomogeneous H-system: Δu = 2Hux Λ uy + f in Ω, u|∂Ω = 0 where Ω ⊂ R2 is a bounded smooth domain, H 0 a constant, and f ∈ H-1(ΩR3) is a given function.By Ekeland's variational principle and the Mountain Pass Theorem, we prove that, for f ≢ 0 satisfying some assumptions, the problem has at least two solutions in H01(Ω R3).This is not the case if f ≡ 0 and Ω is simply-connected [16].
FastMag: a 3-D magnetostatic inductance extraction program for structures with permeable materials
Authors: Yehia Massoud, Jacob White
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

In this paper we present a fast and efficient program for extraction of the frequency dependent inductance of structures with permeable materials. The program, FastMag, uses a magnetic surface charge formulation, efficient techniques for evaluating the required integrals, and a preconditioned GMRES method to solve the resulting linear system. Results from examples are presented to demonstrate the accuracy and versatility of the FastMag program.
Non-tree routing for reliability and yield improvement
Authors: Andrew B. Kahng, Bao Liu, Ion I. Mǎandoiu
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduced at the cost of increased potential for short faults; overall, manufacturing yield and fault tolerance can be improved. We focus on a post-processing, tree augmentation approach which can be easily integrated in current physical design flows. Our contributions are as follows:&bull; We formulate the problem as a variant of the classical 2-edge-connectivity augmentation problem in which we take into account such practical issues as wirelength increase budget, routing obstacles, and use of Steiner points.&bull; We show that an optimum solution can always be found on the Hanan grid defined by the terminals and the corners of the feasible routing region.&bull; We give a compact integer program formulation which, for up to 100 terminal nets, is solved in practical runtime by the commercial optimization package CPLEX.&bull; We give a well-scaling greedy algorithm which has practical runtime up to 1,000 terminals, and comes on the average within 1--2% of the optimum computed by CPLEX.&bull; We give a comprehensive experimental study comparing the solution quality and runtime of our methods with the best reported methods for 2-edge-connectivity augmentation, including a sophisticated heuristic based on minimum-weight branchings [9] and a recent genetic algorithm [14].Experiments on randomly generated and industry testcases show that our greedy augmentation method achieves significant increase in reliability (as measured by the percentage of biconnected tree edges) with very small increase in wirelength. For example, on 1,000 terminal nets the average percentage of biconnected tree edges is 34.19% for a wire-length increase of only 1%, and 87.73% for a wirelength increase of 20%. SPICE simulations on industry routed nets show that non-tree routing has the additional benefit of reducing maximum sink delay by an average of 28.26% compared to Steiner routing, and by an average of 3.72% compared to timing optimized routing. SPICE simulations further imply that non-tree routing has smaller delay variation due to process variability.
Working the Jazz Metaphor: Musings Driving Down I-5 Past Midnight
Authors: Eli Berniker
Venue: Organization Science (1998)

Applying unfettered but disciplined imagination to last night's Academy of Management 1995 session on the jazz metaphor, I asked: How would I design an organization as if it were a medium for improvisational jazz? I know that the design metaphor grates on some sensibilities. Bear with me. I am a tinkerer and bricoleur at heart. I write as thought emerged subject to minor editing.
A Multiserver Queueing System with Impatient Customers
Authors: Nam Kyoo Boots, Henk Tijms
Venue: Management Science (1999)

Many real-world situations involve queueing systems in which customers wait for service for a limited time only and leave the system if service has not begun within that time. This paper considers a multiserver queueing system with impatient customers, where the customers arrive according to a Poisson process and the service requirements have a general distribution. A simple and insightful solution is presented for the loss probability. The solution is exact for exponential services and is an excellent heuristic for general service times.
A realistic variable voltage scheduling model for real-time applications
Authors: Bren Mochocki, Xiaobo Sharon Hu, Gang Quan
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Voltage scheduling is indispensable for exploiting the benefit of variable voltage processors. Though extensive research has been done in this area, current processor limitations such as transition overhead and voltage level discretization are often considered insignificant and are typically ignored. We show that for hard, real-time applications, disregarding such details can lead to sub-optimal or even invalid results. We propose two algorithms that guarantee valid solutions. The first is a greedy yet simple approach, while the second is more complex but significantly reduces energy consumption under certain conditions. Through experimental results on both real and randomly generated systems, we show the effectiveness of both algorithms, and explore what conditions make it beneficial to use the complex algorithm over the basic one.
An assessment of systems and software engineering scholars and institutions (1997-2001)
Authors: R. L. Glass, T. Y. Chen
Venue: Journal of Systems and Software (2002)

This paper presents the findings of a five-year study of the top scholars and institutions in the systems and software engineering field, as measured by the quantity of papers published in the journals of the field. The top scholar is Richard Lai of LaTrobe University in Australia, and the top institution is Carnegie Mellon University and its Software Engineering Institute. The paper lists the top 15 scholars and institutions.
A Fluid Heuristic for Minimizing Makespan in Job Shops
Authors: J. G. Dai, Gideon Weiss
Venue: Operations Research (2002)

We describe a simple online heuristic for scheduling job shops. We assume there is a fixed set of routes for the jobs, and many jobs, sayN, on each route. The heuristic uses safety stocks and keeps the bottleneck machine busy at almost all times, while the other machines are paced by the bottleneck machine. We perform a probabilistic analysis of the heuristic, under some assumptions on the distributions of the processingtimes. We show that our heuristic produces makespan, which exceeds the optimal makespan by no more thanclog N with a probability that exceeds 1-1/ N for allN = 1, wherec is some constant independent ofN.
Evaluating the informative quality of documents in SGML format from judgements by means of fuzzy linguistic techniques based on computing with words
Authors: Enrique Herrera-Viedma, Eduardo Peis
Venue: Information Processing and Management: an International Journal (2003)

Recommender systems evaluate and filter the great amount of information available on the Web to assist people in their search processes. A fuzzy evaluation method of Standard Generalized Markup Language documents based on computing with words is presented. Given a document type definition (DTD), we consider that its elements are not equally informative. This is indicated in the DTD by defining linguistic importance attributes to the more meaningful elements of DTD chosen. Then, the evaluation method generates linguistic recommendations from linguistic evaluation judgements provided by different recommenders on meaningful elements of DTD. To do so, the evaluation method uses two quantifier guided linguistic aggregation operators, the linguistic weighted averaging operator and the linguistic ordered weighted averaging operator, which allow us to obtain recommendations taking into account the fuzzy majority of the recommenders' judgements. Using the fuzzy linguistic modeling the user-system interaction is facilitated and the assistance of system is improved. The method can be easily extended on the Web to evaluate HyperText Markup Language and eXtensible Markup Language documents.
Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management
Authors: Yu-Chee Tseng, Chih-Min Chao
Venue: IEEE Transactions on Mobile Computing (2002)

The use of OVSF codes in WCDMA systems has offered opportunities to provide variable data rates to flexibly support applications with different bandwidth requirements. Two important issues in such an environment are the code placement problem and code replacement problem. The former may have significant impact on code utilization and, thus, code blocking probability, while the latter may affect the code reassignment cost if dynamic code assignment is to be conducted. The general objective is to make the OVSF code tree as compact as possible so as to support more new calls by incurring less blocking probability and less reassignment costs. Earlier studies about these two problems either do not consider the structure of the OVSF code tree or cannot utilize the OVSF codes efficiently. To reduce the call blocking probability and the code reassignment cost, we propose two simple yet efficient strategies that can be adopted by both code placement and code replacement: leftmost and crowded-first. Numerical analyses on call blocking probability and bandwidth utilization of OVSF code trees when code reassignment is supported are provided. Our simulation results show that the crowded-first strategy can significantly reduce, for example, the code blocking probability by 77 percent and the number of reassignments by 81 percent, as opposed to the random strategy when the system is 80 percent fully loaded and the max SF = 256.
Tracking Personal Processes in Group Projects
Authors: Ly Danielle Sauer, Timothy E. Lindquist, Jeremy Cairney
Venue: 23rd International Computer Software and Applications Conference (1999)

Software engineering continues to develop methods for process improvement and quality. The Personal Software Process is one way to introduce software engineers to aspects of process tracking, assessment and improvement. In this paper, we describe the software tools that we've constructed to support the planning and postmortem of software activities. We describe an approach that allows the personal software process to be used in group projects, while still allowing the individual engineer to employ personal process quality and improvement techniques in their own activities. The tools supporting planning and postmortem are used in the context of a workflow system developed at Arizona State University (ASU), called Open Process Components, whose aim is to componentize software services and provide interoperability among various approaches. These tools and approaches explore software development in the increasingly distributed environment in which the software engineer is responsible for their own assessment and improvement.