ppxscal/embedding_network huggingface dataset:
Improved Bounds for the Online Scheduling Problem
Authors: John F. Rudin,  III, R. Chandrasekaran
Venue: SIAM Journal on Computing (2003)

The problem considered here is the same as the one discussed in [G. Galambos and G. J. Woeginger, eds., SIAM J. Comput., 22 (1993), pp. 349--355]. It is an m-machine online scheduling problem in which we wish to minimize the competitive ratio for the makespan objective. In this paper, we show that $\sqrt{3}$ is a lower bound on this competitive ratio for m=4. In particular, we show how to force a lower bound of $\sqrt{3\,}-\epsilon $ for any positive $\epsilon $. This reduces the gap between the performance of known algorithms [S. Albers, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, ACM, New York, 1997, pp. 130--139] and the lower bound. The method used introduces an approach to building the task master's strategy.
A New Interior-Point Boundary Projection Method For Solving Nonlinear Groundwater Pollution Control Problems
Authors: Ann E. Mulligan, David P. Ahlfeld
Venue: Operations Research (2002)

A new interior-point algorithm for solving the groundwater-pollution-control design problem is presented. The algorithm requires that the objective function is differentiable in the interior region. For minimization problems with nonlinear constraints and a concave objective function, the technique is shown to be similar to an active set gradient-projection method, where the tangent of the boundary between feasible and infeasible solutions is used to determine a search direction. In this new method, however, the search direction is translated into the interior space of the feasible region. This process allows progress to be made toward improving the objective function while remaining in the feasible space and ultimately converges to a stationary point. Although the solution technique was developed to solve a groundwater control formulation with a linear objective function and nonlinear constraints, the method has been successfully applied to an unconstrained nonconcave/nonconvex formulation and may be applicable to a wide variety of problems.
Can we improve the perceived quality of economic forecasts?
Authors: Clive W. J. Granger
Venue: Essays in econometrics: Spectral analysis, seasonality, nonlinearity, methodology, and forecasting (2001)

A number of topics are discussed concerning how economic forecasts can be improved in quality or at least in presentation. These include the following: using 50% uncertainty intervals rather than 95 %; noting that even though forecasters use many different techniques, they are all occasionally incorrect in the same direction; that there is a tendency to underestimate changes; that some expectations and recently available data are used insufficiently; lagged forecasts errors can help compensate for structural breaks; series that are more forecastable could be emphasized and that present methods of evaluating forecasts do not capture the useful properties of some methods compared to alternatives.
ODE: a tool for distributing object-oriented applications
Authors: Sandeep Purao, Hemant K. Jain, Derek L. Nazareth
Venue: Information and Management (2002)

Object-oriented applications are increasingly being deployed in distributed computing environments. Technologies, such as Java RMI, and architectures, such as CORBA, DCOM, and Enterprise Java Beans, are facilitating and enhancing this trend. The performance and eventual success of these applications is dependent on distribution decisions made by the application designer. This decision is a complex one, involving a large number of alternatives and multiple conflicting criteria. Rigorous approaches for effective distribution of object-oriented applications are still lacking. This paper describes the implementation of a practical and effective approach for distributing object-oriented applications. A prototype decision support system-- object distribution environment (ODE)--that implements the approach in the form of a user-friendly tool for the design of distributed object-oriented applications is described. ODE has been successfully used in the distribution of a real world distributed object-oriented system.
The optimal testing in photonic switching networks using tabulation methodology
Authors: I-Shyan Hwang, I-Feng Huang
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

Optical crosstalk, a problem commonly found in Dilated Optical Multistage Interconnection Networks (DOMINs), is the outcome of undesirable coupling within a 2 × 2 directional coupler. As widely recognized, a switch is faulty if it causes crosstalk in excess a given threshold, the value of which can be determined according to certain criteria. Diagnosing faulty switches, which includes detection and location procedures, has become an important issue for DOMINs. The fault cluster (or test set) is an independent set of tests for diagnosing faulty switches. The test patterns (or disjoint faults) in each fault cluster can be applied in parallel during diagnosis. The fault-table method is a classical analytic and deterministic minimization method used in the circuit testing of VLSI. The method is especially efficient when tackling complicated circuits, and can be solved efficiently by modern computer technology. An algorithm that uses the tabulation method is developed to obtain the optimal fault cluster(s) for both detection and location tests. The paths of the injected signal, output signal and faulty signal throughout the network are collected to determine the conflict table. Then, the conflict table is minimized to yield the fault clusters. The fault clusters are then stored in the management system. The results can help us to diagnose faulty switches in parallel to accelerate the diagnosis. The tabulation methodology follows the same diagnostic procedure for the various infrastructures and is independent of the size of the DOMINs. Furthermore, a computer program can simulate the procedure and the results support the optimal test.
Embedding an SQL database with SQLite
Authors: Michael Owens
Venue: Linux Journal (2003)

You don't have to start doing DBA work just to run your SQL application on an embedded system or demo laptop. Simplify your life.
An algorithm for computing estimators that optimize step functions
Authors: Spyros Skouras
Venue: Computational Statistics Data Analysis (2003)

The average of a large number of random step functions produces a discontinuous surface with a large number of local optima although it may converge to a smooth surface with a unique optimum as the number of step functions tends to infinity. Such a function arises when certain types of econometric estimators are used, including variants of the maximum score estimator. I propose an algorithm for computing the optimum of such a surface, where standard gradient-based optimization methods are inapplicable. This algorithm replaces the discontinuous surface with a sequence of easily optimized continuous surfaces that converge to it. Sufficient conditions for the algorithm to converge to a global optimum are given and the algorithm's performance is evaluated in a simple but relevant application.
Building secure wireless local area networks
Venue: Wireless local area networks: the new wireless revolution (2002)

Ubiquitous network access without wires. This is the powerful drawing card for the deployment of wireless networking technology. But, for many, this powerful advantage is seen as double-edged--providing increased flexibility and ease of use on one side, tempered by heightened security risks on the other. Essentially, the inability to physically secure a wireless network is considered to be its Achilles' heel. But this conclusion is flawed because it places the burden for security at the physical layer instead of at the network layer, where it makes much more sense. To dispel the wireless security myth, this chapter explains how to protect data with a secure wireless implementation.
Automatic Annotation and Retrieval of Images
Authors: Yuqing Song, Wei Wang, Aidong Zhang
Venue: World Wide Web (2003)

Although a variety of techniques have been developed for content-based image retrieval (CBIR), automatic image retrieval by semantics still remains a challenging problem. We propose a novel approach for semantics-based image annotation and retrieval. Our approach is based on the monotonic tree model. The branches of the monotonic tree of an image, termed as structural elements, are classified and clustered based on their low level features such as color, spatial location, coarseness, and shape. Each cluster corresponds to some semantic feature. The category keywords indicating the semantic features are automatically annotated to the images. Based on the semantic features extracted from images, high-level (semantics-based) querying and browsing of images can be achieved. We apply our scheme to analyze scenery features. Experiments show that semantic features, such as sky, building, trees, water wave, placid water, and ground, can be effectively retrieved and located in images.
Hierarchical data security in a query-by-example interface for a shared database
Authors: Merwyn Taylor
Venue: Journal of Biomedical Informatics (2002)

Whenever a shared database resource, containing critical patient data, is created, protecting the contents of the database is a high priority goal. This goal can be achieved by developing a Query-By-Example (QBE) interface, designed to access a shared database, and embedding within the QBE a hierarchical security module that limits access to the data. The security module ensures that researchers working in one clinic do not get access to data from another clinic. The security can be based on a flexible taxonomy structure that allows ordinary users to access data from individual clinics and super users to access data from all clinics [1]. All researchers submit queries through the same interface and the security module processes the taxonomy and user identifiers to limit access. Using this system, two different users with different access rights can submit the same query and get different results thus reducing the need to create different interfaces for different clinics and access rights.
The single machine ready time scheduling problem with fuzzy processing times
Authors: Chengyao Wang, Dingwei Wang, W. H. Ip, D. W. Yuen
Venue: Fuzzy Sets and Systems (2002)

This paper studies a ready time scheduling problem with fuzzy job processing times. Firstly, we assume that the fuzzy processing time can be represented by a triangular fuzzy number. Then we apply the technique of chance constrained programming to construct a job completion likelihood profile from the job membership functions so that the likelihood of completing the queued jobs has a crisp mathematical representation. Some properties of the likelihood profile are subsequently discussed. Utilizing the fuzzy extension principle and the concept of job completion likelihood profile, the ready time scheduling model that maximizes the common ready time with crisp processing times is extended to one with fuzzy processing times. Optimal solutions for the scheduling model under several special conditions are developed, and a necessary condition that the optimal solution must satisfy when the jobs have different due dates and confidence levels is also established.
Efficient Distribution-Based Event Filtering
Authors: Annika Hinze, Sven Bittner
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Event notification services are used in various applications, for example, stock tickers, environmental monitoring, and facility management. Several filtering algorithms for such services have been proposed. The best performance results are achieved by tree-based algorithms. However, to our knowledge existing algorithms do not consider the influence of event and profile distribution on the filter performance. In this paper we propose a distribution-dependent improvement of the tree-algorithm. We present the test results of our prototypical implementation that show the influence of various distribution-based measures on the performance.
The social responsibility of information systems developers
Authors: N. F. du Plooy
Venue: Socio-technical and human cognition elements of information systems (2003)

Information systems professionals have often been accused of ignoring issues such as ethics, human factors, social consequences, etc., during the development of an information system. This chapter aims to put into perspective that this attitude or 'fact' could be a result of a somewhat outdated mechanistic view of information systems and their role in organizations. Organizations adopt and use information systems for a variety of reasons, of which some of the most influential on the outcome or success of the systems often are neither planned nor anticipated. It is these reasons and their consequences that are the main point of discussion in this chapter. The importance of viewing information systems as social systems is stressed and it is pointed out that the 'social side' of information systems is the 'other side of the coin' of technical development methodologies. In the modern organization all work is so intertwined with the use of information technology, that the one side cannot be considered, planned or developed, without considering the other. It is furthermore argued that it is the social responsibility of information systems professional to ensure that the human environment within which systems are being developed is cultivated and nurtured.
SAT and ATPG: Boolean engines for formal hardware verification
Authors: Armin Biere, Wolfgang Kunz
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

In this survey, we outline basic SAT- and ATPG- procedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and provide a basic orientation concerning the problem formulations and known approaches in this active field of research.
Workshop on moving to visual basic.net
Authors: Gary Ury
Venue: Journal of Computing Sciences in Colleges (2003)

This workshop and accompanying paper will discuss and demonstrate some of the strengths and weaknesses of the new VB.Net object-oriented programming language. It is appropriate for anyone who is contemplating a course in the new language or anyone who just wants to know more about VB.Net architecture. Database connectivity and web applications will be demonstrated in addition to some fundamental navigational and Interactive Development Environment (IDE) issues. Finally, the authors will share their experiences in developing and teaching VB.Net as a second or third language to junior and senior CS/IS majors and minors at Northwest Missouri State University.
A survey on wavelet applications in data mining
Authors: Tao Li, Qi Li, Shenghuo Zhu, Mitsunori Ogihara
Venue: ACM SIGKDD Explorations Newsletter (2002)

Recently there has been significant development in the use of wavelet methods in various data mining processes. However, there has been written no comprehensive survey available on the topic. The goal of this is paper to fill the void. First, the paper presents a high-level data-mining framework that reduces the overall process into smaller components. Then applications of wavelets for each component are reviewd. The paper concludes by discussing the impact of wavelets on data mining research and outlining potential future research directions and applications.
Learning response time for WebSources using query feedback and application in query optimization
Authors: Jean-Robert Gruser, Louiqa Raschid, Vladimir Zadorozhny, Tao Zhan
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2000)

The rapid growth of the Internet and support for interoperability protocols has increased the number of Web accessible sources, WebSources. Current wrapper mediator architectures need to be extended with a wrapper cost model (WCM) for WebSources that can estimate the response time (delays) to access sources as well as other relevant statistics. In this paper, we present a Web prediction tool (WebPT), a tool that is based on learning using query feedback from WebSources. The WebPT uses dimensions time of day, day, and quantity of data, to learn response times from a particular WebSource, and to predict the expected response time (delay) for some query. Experiment data was collected from several sources, and those dimensions that were significant in estimating the response time were determined. We then trained the WebPT on the collected data, to use the three dimensions mentioned above, and to predict the response time, as well as a confidence in the prediction. We describe the WebPT learning algorithms, and report on the WebPT learning for WebSources. Our research shows that we can improve the quality of learning by tuning the WebPT features, e.g., training the WebPT using a logarithm of the input training data; including significant dimensions in the WebPT; or changing the ordering of dimensions. A comparison of the WebPT with more traditional neural network (NN) learning has been performed, and we briefly report on the comparison. We then demonstrate how the WebPT prediction of delay may be used by a scrambling enabled optimizer. A scrambling algorithm identifies some critical points of delay, where it makes a decision to scramble (modify) a plan, to attempt to hide the expected delay by computing some other part of the plan that is unaffected by the delay. We explore the space of real delay at a WebSource, versus the WebPT prediction of this delay, with respect to critical points of delay in specific plans. We identify those cases where WebPT overestimation or underestimation of the real delay results in a penalty in the scrambling enabled optimizer, and those cases where there is no penalty. Using the experimental data and WebPT learning, we test how good the WebPT is in minimizing these penalties.
A new direction in AI: toward a computational theory of perceptions
Authors: Lotfi A. Zadeh
Venue: Technologies for constructing intelligent systems: Tasks (2002)

Humans have a remarkable capability to perform a wide variety of physical and mental tasks without any measurements and any computations. Familiar examples are parking a car, driving in city traffic, playing golf, cooking a meal, and summarizing a story. In performing such tasks, humans use perceptions of time, direction, speed, shape, possibility, likelihood, truth, and other attributes of physical and mental objects. Reflecting the bounded ability of the human brain to resolve detail, perceptions are intrinsically imprecise. In more concrete terms, perceptions are f-granular, meaning that (1) the boundaries of perceived classes are unsharp and (2) the values of attributes are granulated, with a granule being a clump of values (points, objects) drawn together by indistinguishability, similarity, proximity, and function. For example, the granules of age might be labeled very young, young, middle aged, old, very old, and so on.F-granularity of perceptions puts them well beyond the reach of traditional methods of analysis based on predicate logic or probability theory. The computational theory of perceptions (CTP), which is outlined in this article, adds to the armamentarium of AI a capability to compute and reason with perception-based information. The point of departure in CTP is the assumption that perceptions are described by propositions drawn from a natural language; for example, it is unlikely that there will be a significant increase in the price of oil in the near future.In CTP, a proposition, p, is viewed as an answer to a question, and the meaning of p is represented as a generalized constraint. To compute with perceptions, their descriptors are translated into what is called the generalized constraint language (GCL). Then, goal-directed constraint propagation is utilized to answer a given query. A concept that plays a key role in CTP is that of precisiated natural language (PNL).The computational theory of perceptions suggests a new direction in AI--a direction that might enhance the ability of AI to deal with real-world problems in which decision-relevant information is a mixture of measurements and perceptions. What is not widely recognized is that many important problems in AI fall into this category.
Quantifier guided aggregation of fuzzy criteria with associated importances
Authors: I. Blanco, M. Delgado, M. J. Martín-Bautista, D. Sánchez, M. A. Vila
Venue: Aggregation operators: new trends and applications (2002)

The evaluation of quantified sentences of the form "Q of D are A" is recognized as a suitable tool for quantifier guided aggregation of fuzzy criteria with associated importances. In this paper we discuss the properties any good evaluation method should verify. We study a new method to evaluate quantified sentences. Our new method is shown to be an extension of the quantified aggregation via the Choquet integral when all the criteria are equally important and a monotone increasing quantifier is employed.
Coupling-aware high-level interconnect synthesis for low power
Authors: Chun-Gi Lyuh, Taewhan Kim, Ki-Wook Kim
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Ultra deep submicron (UDSM) technology and system-on-chip (SoC) have resulted in a considerable portion of power dissipated on buses, in which the major sources of the power dissipation are (1) the transition activities on the signal lines and (2) the coupling capacitances of the lines. However, there has been no easy way of optimizing (1) and (2) simultaneously at an early stage of the synthesis process. In this paper, we propose a new (on-chip) bus synthesis algorithm to minimize the total sum of (1) and (2) in the microarchitecture synthesis. Specifically, unlike the previous approaches in which (1) and (2) are minimized sequentially without any interaction between them, or only one of them is minimized, we, given a scheduled dataflow graph to be synthesized, minimize (1) and (2) simultaneously by formulating and solving the two important issues in an integrated fashion: binding data transfers to buses and determining a (physical) order of signal lines in each bus, both of which are the most critical factors that affect the results of (1) and (2). Experimental results on a number of benchmark problems show that the proposed integrated low-power bus synthesis algorithm reduces power consumption by 24.8%, 40.3% and 18.1% on average over those in [12] (for minimizing (1) only), [1] (for (2) only) and [12, 1] (for (1) and then (2)), respectively.
Design considerations for a financial management system for rural, semi-literate users
Authors: Kaushik Ghosh, Tapan S. Parikh, Apala Lahiri Chavan
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

In this paper, we describe the design process, results, and general observations obtained in designing a user interface for managing community-based micro-finance institutions in rural India. The primary users studied were semi-literate village women. We discuss our contextual study observations and conclude by presenting a grounded design approach that best leverages the existing learning patterns of the users.