ppxscal/embedding_network huggingface dataset:
A decision support system for farm planning using AgriSupport II
Authors: B. Recio, F. Rubio, J. A. Criado
Venue: Decision Support Systems (2003)

The farm planning problem is a critical aspect in the design of decision support systems (DSSs) for complex farm advising. Traditionally, the approaches to this problem have been very simple and unable to manage the complexity of the problem, which involves scheduling of field tasks, investment analysis, machinery selection, cost/benefit analysis, and other aspect of the agricultural production process. A new approach to this problem is presented for medium-large farms and integrated in a more general framework to build DSSs in agriculture. The system have been validated for the technicians of Albacete Provincial Technical Agricultural Institute (ITAP) and accepted as the core of future broad DSSs for their use. This is overall objective of the AgriSupport II project.
Induced matchings in asteroidal triple-free graphs
Authors: Jou-Ming Chang
Venue: Discrete Applied Mathematics (2003)

An induced matching M of a graph G is a set of pairwise nonadjacent edges such that no two edges of M are joined by an edge in G. The problem of finding a maximum induced matching is known to be NP-hard even for bipartite graphs of maximum degree four. In this paper, we study the maximum induced matching problem on classes of graphs related to AT-free graphs. We first define a wider class of graphs called the line-asteroidal triple-free (LAT-free) graphs which contains AT-free graphs as a subclass. By examining the square of line graph of LAT-free graphs, we give a characterization of them and apply this for showing that the maximum induced matching problem and a generalization, called the maximum δ-separated matching problem, on LAT-free graphs can be solved in polynomial time. In fact, our result can be extended to the classes of graphs with bounded asteroidal index. Next, we propose a linear-time algorithm for finding a maximum induced matching in a bipartite permutation (bipartite AT-free) graph using the greedy approach. Moreover, we show that using the same technique the minimum chain subgraph cover problem on bipartite permutation graphs can be solved with the same time complexity.
SWEC: a Step Wise Equivalent Conductance timing simulator for CMOS VLSI circuits
Authors: Shen Lin, M. Marek-Sadowska, Ernest S. Kuh
Venue: Proceedings of the conference on European design automation (1991)

Timing simulation has always been considered a crucial step in digital VLSI circuit designs. Many researchers have addressed the issues of time efficiency vs. accuracy by using simpler device models and by simplifying the numerical algorithms. StepWise Equivalent Conductance (SWEC) simulation technique, first proposed in [1], is an alternative which approximates the nonlinear transfer characteristic of the transistor with stepwise constant conductances. In this paper we demonstrate that the time step can be controlled to provide the necessary accuracy in the implicit integration algorithm. A timing simulator has been built based on this principle. The simulator can handle very large CMOS designs. Comparisons have been made with XPsim [2] and SPECS2 [3] using several examples. The results indicate that SWEC exhibits far better efficiency and accuracy.
Formal verification of timing conditions
Authors: Hans Eveking, Christoph Mai
Venue: Proceedings of the conference on European design automation (1990)

Most timing-verifiers are analytical tools that determine, e.g., the delays on all paths, etc. This paper presents a completely different approach: timing-verification is performed by means of the formal transformation of CHDL descriptions. The principles of this procedure are presented and performance results of an implementation are given.
A practical SVM-based algorithm for ordinal regression in image retrieval
Authors: Hong Wu, Hanqing Lu, Songde Ma
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Most current learning algorithms for image retrieval are based on dichotomy relevance judgement (relevant and non-relevant), though this measurement of relevance is too coarse. To better identify the user needs and preference, a good retrieval system should be able to handle multilevel relevance judgement. In this paper, we focus on relevance feedback with multilevel relevance judgment, where the relevance feedback is considered as an ordinal regression problem. Herbrich has proposed a support vector learning algorithm for ordinal regression based on the Linear Utility Model. His algorithm is intrinsically to train a SVM on a new derived training set, whose size increases rapidly when the original training set gets bigger. This property limits its applicability in relevance feedback, due to real-time requirement of the interactive process. By thoroughly analyzing Herbrich's algorithm, we first propose a new model for ordinal regression, called Cascade Linear Utility Model, then a practical SVM-based algorithm for image retrieval upon it. Our new algorithm is tested on a real-world image database, and compared with other three algorithms capable to handle multilevel relevance judgment. The experimental results show that the retrieval performance of our algorithm is comparable with that of Herbrich's algorithm but with only a fraction of its computational time, and apparently outperform the other methods.
Operational requirements for scalable search systems
Authors: Abdur Chowdhury, Greg Pass
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Prior research into search system scalability has primarily addressed query processing efficiency [1, 2, 3] or indexing efficiency [3], or has presented some arbitrary system architecture [4]. Little work has introduced any formal theoretical framework for evaluating architectures with regard to specific operational requirements, or for comparing architectures beyond simple timings [5] or basic simulations [6, 7]. In this paper, we present a framework based upon queuing network theory for analyzing search systems in terms of operational requirements. We use response time, throughput, and utilization as the key operational characteristics for evaluating performance. Within this framework, we present a scalability strategy that combines index partitioning and index replication to satisfy a given set of requirement.
The development of initial trust in an online company by new customers
Authors: Marios Koufaris, William Hampton-Sosa
Venue: Information and Management (2004)

Lack of trust in online companies is a primary reason why many web users do not shop online. This study proposes a model to explain how new customers of a web-based company develop initial trust in the company after their first visit. The model is empirically tested using a questionnaire-based field study. The results indicate that perceived company reputation and willingness to customize products and services can significantly affect initial trust. Perceived web site usefulness, ease of use, and security control are also significant antecedents of initial trust. Finally, we found no support for the hypothesized effect of individual customer trust propensity on initial trust.
Categorizing web queries according to geographical locality
Authors: Luis Gravano, Vasileios Hatzivassiloglou, Richard Lichtenstein
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Web pages (and resources, in general) can be characterized according to their geographical locality. For example, a web page with general information about wildflowers could be considered a global page, likely to be of interest to a geographically broad audience. In contrast, a web page with listings on houses for sale in a specific city could be regarded as a local page, likely to be of interest only to an audience in a relatively narrow region. Similarly, some search engine queries (implicitly) target global pages, while other queries are after local pages. For example, the best results for query [wildflowers] are probably global pages about wildflowers such as the one discussed above. However, local pages that are relevant to, say, San Francisco are likely to be good matches for a query [houses for sale] that was issued by a San Francisco resident or by somebody moving to that city. Unfortunately, search engines do not analyze the geographical locality of queries and users, and hence often produce sub-optimal results. Thus query [wildflowers] might return pages that discuss wildflowers in specific U.S. states (and not general information about wildflowers), while query [houses for sale] might return pages with real estate listings for locations other than that of interest to the person who issued the query. Deciding whether an unseen query should produce mostly local or global pages---without placing this burden on the search engine users---is an important and challenging problem, because queries are often ambiguous or underspecify the information they are after. In this paper, we address this problem by first defining how to categorize queries according to their (often implicit) geographical locality. We then introduce several alternatives for automatically and efficiently categorizing queries in our scheme, using a variety of state-of-the-art machine learning tools. We report a thorough evaluation of our classifiers using a large sample of queries from a real web search engine, and conclude by discussing how our query categorization approach can help improve query result quality.
The future of computers and the teaching of engineering design
Authors: William R. Spillers
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

I would like to begin with a list of some of the things that are happening today in the arena of engineering design and how it is to be taught.
Possibilities of the Application of Fractal Lines and Grouped Operations in Multiprocessor Systems with a Rearrangeable Structure for Evolutionary Computations
Authors: G. G. Stetsyura
Venue: Automation and Remote Control (2003)

Fractal lines and grouped operations are considered for the use in multiprocessor computers with a rearrangeable structure of lines, which execute evolutionary algorithms. The regularity of fractal lines facilitates the subdivision of the common structure into portions and the performance of grouped operations. Grouped operations enable many processors to interact within one operation for obtaining the common result, which simplifies and accelerates the elaboration of collective decisions.
Design of Software Applications Using Generic Business Components
Authors: Boris Shishkov, Jan L. G. Dietz
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

One frequent cause of software project failure is the mismatch between the (business) requirements and the actual functionality of the delivered (software) application. An approach is proposed in this paper, for design of software, basing consistently this design on prior business process modeling. The alignment between these two tasks is realized in a component-based way, by deriving the software model from identified (generic) business components, thus - taking advantage of the benefits of object-orientation. The paper introduces not only the concepts of the approach but also elaborated views on how it could be implemented using particular software design and business process modeling techniques. A way to implement the approach is through UML - the standard language for designing software. The suggested approach is expected to be a useful contribution to the knowledge on aligning business process modeling and software design.
Assessing computer literacy: a comparison of self-assessment and actual skills
Authors: George Easton, Annetre Easton
Venue: Current issues in IT education (2003)

The ubiquity of the Internet in our daily lives and the pervasiveness of computer technology in K-12 education today suggest that incoming college students should be better prepared to use computer technology than their predecessors. This chapter presents the results of a study to determine the incoming computing skills levels of business students. The study also measured the difference between the students' self-assessment of these computer skills and an actual assessment of their computer skills. In discovering what level of computer literacy our students actually have, and pinpointing areas where students lack proficiency, we can look to develop curriculum to address the weaknesses. Our goal would be to look at developing a curriculum model that provides flexibility in tailoring content to accommodate the evolving literacy of students, ultimately providing a richer educational experience for our students.
Relating cognitive problem-solving style to user resistance
Authors: Michael Mullany, Peter Lay
Venue: The economic and social impacts of e-commerce (2003)

This study investigated the relationships between user resistance to new information systems and the differences in cognitive problem-solving styles between systems developers (analysts) and users. In addition, associations were tested between user resistance and the following: system accuracy, system reliability, the analyst's attitude, the analyst-user relationship, analystuser dissonance, the user's age and the user's length of service with his current employer.A significant positive association between user resistance and analystuser cognitive style difference was found. A model was then developed which enables the estimation of user resistance prior to system development with the aid of the Kirton Adaptive/Innovative Inventory (an instrument which measures cognitive style). Significant negative associations were found to exist between user resistance and system accuracy, and user resistance and system reliability. No relationships between user resistance and either user age or user length of service were found.
Approximating Multiobjective Knapsack Problems
Authors: Thomas Erlebach, Hans Kellerer, Ulrich Pferschy
Venue: Management Science (2002)

For multiobjective optimization problems, it is meaningful to compute a set of solutions covering all possible trade-offs between the different objectives. The multiobjective knapsack problem is a generalization of the classical knapsack problem in which each item has several profit values. For this problem, efficient algorithms for computing a provably good approximation to the set of all nondominated feasible solutions, the Pareto frontier, are studied.For the multiobjective one-dimensional knapsack problem, a practical fully polynomial-time approximation scheme (FPTAS) is derived. It is based on a new approach to the single-objective knapsack problem using a partition of the profit space into intervals of exponentially increasing length. For the multiobjectivem-dimensional knapsack problem, the first known polynomial-time approximation scheme (PTAS), based on linear programming, is presented.
Module synthesis for finite state machines
Authors: A. Kuehlmann, Y. Manoli
Venue: Proceedings of the conference on European design automation (1991)

This paper presents a new layout style for automatic synthesis of Finite State Machines which is suitable for full custom as well as sea-of-gate layouts. It is based on a combined use of slice techniques, which result in a compact layout, and on a matrix layout style to ensure the flexibility of this approach. For the layout optimization multiple row folding has to be performed, for which a genetic optimization algorithm is presented. Some experimental results will conclude the paper.
Some results on graphs without long induced paths
Authors: Vadim Lozin, Dieter Rautenbach
Venue: Information Processing Letters (2003)

Many NP-hard graph problems remain difficult on Pk-free graphs for certain values of k. Our goal is to distinguish subclasses of Pk-free graphs where several important graph problems can be solved in polynomial time. In particular, we show that the independent set problem is polynomial-time solvable in the class of (Pk, K1,n)-free graphs for any positive integers k and n, thereby generalizing several known results.
On well-covered triangulations: Part I
Authors: A. Finbow, B. Hartnell, R. Nowakowski, Michael D. Plummer
Venue: Discrete Applied Mathematics (2003)

A graph G is said to be well-covered if every maximal independent set of vertices has the same cardinality. A planar (simple) graph in which each face is a triangle is called a triangulation. It is the aim of this paper to prove that there are no 5-connected planar well-covered triangulations.
Toward High-Precision Service Retrieval
Authors: Mark Klein, Abraham Bernstein
Venue: IEEE Internet Computing (2004)

Online repositories are increasingly being called on to provide access to services that describe or provide useful behaviors. Existing techniques for finding the services offer low retrieval precision, returning many irrelevant matches. This article describes a novel service retrieval approach that captures service semantics via process models, and applies a pattern-matching algorithm to locate desired services.
Controlling Information Systems Development Projects: The View from the Client
Authors: Laurie J. Kirsch, V. Sambamurthy, Dong-Gil Ko, Russell L. Purvis
Venue: Management Science (2002)

Increasingly, business clients are actively leading information systems (IS) projects, often in collaboration with IS professionals, and they are exercising a greater degree of project control. Control is defined as all attempts to motivate individuals to achieve desired objectives, and it can be exercised via formal and informal modes. Much of the previous research investigating the choice of control mode has focused on direct reporting relationships between IS project leaders and their superiors in a hierarchical setting. However, the client-IS relationships may take on a variety of forms, including both hierarchical and lateral settings. Moreover, prior research has found that the knowledge of the systems development process is a key antecedent of control, yet clients are unlikely to be as knowledgeable as IS professionals about this process. It is therefore unclear whether prior findings will generalize to the client-IS pair, and the goal of this research is to examine the exercise of control across this relationship. Data were gathered from a questionnaire survey of 69 pairs of clients and IS project leaders. The results are largely consistent with prior research on the antecedents offormal control modes, but they shed new insight on the choice ofinformal control modes.
Loop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow
Authors: Sumit Gupta, Nikil Dutt, Rajesh Gupta, Alexandru Nicolau
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Emerging embedded system applications in multimedia and image processing are characterized by complex control flow consisting of deeply nested conditionals and loops. Wepresent a technique called loop shifting that incrementally exploits loop level parallelism across iterations by shifting and compacting operations across loop iterations. Our experimental results show that loop shifting is particularly effective for the synthesis of designs with complex control especially when resource utilization is already high and/or under tight resource constraints. In situations when further loop unrolling (or initiating another iteration of the loop body) leads to a sharp increase in the longest combinational path in the circuit and the circuit area, loop shifting is able to achieve up to 20 % reduction in the input-to-output delay in the synthesized circuit. We implemented loop shifting within the SPARK parallelizing high-level synthesis framework and present results for experiments on designs derived from multimedia and image processing applications.
Parameters of a 2.4 GHZ Wide Band Radio Channel for WLAN Applications
Authors: G. F. Serrano Moya, J. L. Zamorano Flores
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

In the design, performance evaluation andinstallation of indoor radio communication systems,which require a continuous coverage and reliability, isnecessary to have an accurate characterization of thechannel. The radio channel is inherently random, theeffects over transmitted signal impacts the overallperformance of the system, producing severe fadingand time dispersion, the time dispersion is a potentialsource of intersymbol interference, which yield errorsin the receiver. In order to compensate theseundesirable effects, by means an adequate receiverdesign, is essential to know the attenuation and timedispersion statistics of the signal and, even better, thechannel's impulse response which is a fullycharacterization of the channel. In this work we use adata base which contains snapshots of the channelimpulse response at several distances, obtained bycomputer simulation, using a statistical model, in orderto determine the total multipath power gain and therms delay spread. From these parameters we are ableto evaluate the radio coverage, the base stationsoptimum location, the interference and the maximumachievable data rate without requiring equalization inthe receiver.
SYSL: system description language
Authors: Nobuyoshi Terashima
Venue: ACM SIGPLAN Notices (1974)

SYSL-System Description Language, which is a higer level language like FORTRAN, COBOL and so on, has been developed as a system implementation language for use by DIPS-1 operating system, a large scale OS for time-sharing services, banking control services and so on.Run-time efficiency and space efficiency of SYSL object codes are 1.11 time and 1.17 times, respectively, of those obtained from assembly language.SYSL has been used to write about 90 per cent of language processors and other processing programs of DIPS-1 OSSYSL has reduced the huge amount of time required for coding, debugging, maintaining and documenting.
Online Investment Self-Efficacy: Development and Initial Test of an Instrument to Assess Perceived Online Investing Abilities
Authors: Clayton A. Looney, Joseph S. Valacich, Asli Y. Akbulut
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

This paper develops and tests an instrument to measure online investment self-efficacy, defined as an individual's perceived ability to utilize online technologies to accomplish investing-related tasks. A series of empirical studies were conducted to establish the measure's psychometric properties. The results suggest that the measure exhibits admirable levels of reliability, as well as convergent, discriminant, and nomological validity. As predicted by theory, computer self-efficacy was found to serve as an important precursor to online investment self-efficacy. Furthermore, online investment self-efficacy played a significant role in fueling investor preference for the traditional (full-service) or online investing approach. More efficacious investors tended to prefer Web-based technologies as a vehicle for investing, whereas less efficacious individuals favored the traditional method.