ppxscal/embedding_network huggingface dataset:
On the orientation of graphs and hypergraphs
Authors: András Frank, Tamás Király, Zoltán Király
Venue: Discrete Applied Mathematics (2003)

Graph orientation is a well-studied area of combinatorial optimization, one that provides a link between directed and undirected graphs. An important class of questions that arise in this area concerns orientations with connectivity requirements. In this paper we focus on how similar questions can be asked about hypergraphs, and we show that often the answers are also similar many known graph orientation theorems can be extended to hypergraphs, using the familiar uncrossing techniques. Our results also include a short proof and an extension of a theorem of Khanna et al. (Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Alogrithm, 2001, pp. 663-671), and a new orientation theorem that provides a characterization for (2k + 1)-edge-connected graphs.
The impact of computer-based technology on faculty members' work at the itesm's guadalajara campus (mexico)
Authors: Jesus Enrique Ramos
Venue:  (2003)

Higher education administrators around the world are promoting an increased use of educational technologies in the academe based on the assumption that these technologies offer the opportunity to improve students' learning. However, most of the time administrators do not take into consideration the effect that technology might have on faculty members. Through an exploratory case study, this research project seeks to provide a better understanding of the impact of computer-based technology on faculty members' work and on the conditions under which this impact occurs. Structured interviews with administrators and faculty members as well as document analyses from the ITESM's Guadalajara Campus will be used in order to provide a deeper understanding of how faculty members have responded to the required use of specific educational technologies. It is anticipated that this study will show that beliefs and assumptions held by administrators have strong effects on the institution's strategic choices and policies regarding new educational technologies. Furthermore, it is believed that this study will provide examples of the effect of new educational technologies on faculty members' skills. Finally, it is expected that this study will make significant recommendations for higher education administrators to assist in developing technology-related policies that are better suited not only for students but also for faculty members.
An Extension of the Behavioral Theory of Group Performance in Software Development Technical Reviews
Authors: Lesley Pek Wee Land, Bernard Wong, Ross Jeffery
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

In the original theory of group performance in softwaredevelopment technical reviews there was noconsideration given to the influence of the inspectionprocess, inspection performance, or the inspectedartifact, on the structure of the theoretical model.thispaper presents an extended theoretical model, alongwith discussion and justification for components of thenew model.These extensions include consideration ofthe software product quality attributes, the prescriptiveprocesses now developed for reviews, and a moredetailed consideration of the technical and non-technicalcharacteristics of the inspectors.In this paper wepresent both the structure of the model and the nature ofthe interactions between elements in the model.Consideration is also given to the opportunity forincreased formalism in the technical review process.We show that opportunity exists to both improveindustrial practice and extend research-based knowledgeof the technical review process and context.
Dynamics of equatorial highlands on venus
Authors: Alexei V. Vezolainen
Venue:  (2003)

Recent constraints on the age of Venusian equatorial highlands, generally considered to be plume-related structures, suggests that the Beta Regio equatorial highland was emplaced over a relatively short period of time in the recent Venus history (100&ndash;400 m.y.). The emplacement of Laufey, Western and Central Eistla regions took place at the time close to the average age of Venusian surface (300&ndash;750 m.y.), and Atla Regio was active relatively recently (30&ndash;70 m.y.). We perform numerical simulations which use this evidence as a new constraint on geodynamic models. Two-dimensional models require the strength of the Venusian lithosphere to be similar to that of the Earth to satisfy simultaneously the constraint on the uplift rate and the constraints on gravity, topography and rheology. This is difficult to reconcile with the differences in the abundance of water for the Earth and Venus (Venus is essentially dry). Three-dimensional models can resolve this contradiction. Three-dimensional plumes exert a more concentrated force on the lithosphere and accelerate the uplift by a factor of 2. This seems to be sufficient to satisfy the constraints on the uplift rate, geoid, topography, and the rheology of a dry olivine.
Random suffix search trees
Authors: Luc Devroye, Ralph Neininger
Venue: Random Structures Algorithms (2003)

A random suffix search tree is a binary search tree constructed for the suffixes Xi = 0. BiBi+1Bi+2 ... of a sequence B1, B2, B3 .... of independent identically distributed random b-ary digits Bj. Let Dn denote the depth of the node for Xn in this tree when B1 is uniform on Zb. We show that for any value of b > 1, EDn = 2 log n + O(log2log n), just as for the random binary search tree. We also show that Dn/EDn → 1 in probability.
Learning in design: From characterizing dimensions to working systems
Authors: Yoram Reich
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

The application of machine learning (ML) to solve practical problems is complex. Only recently, due to the increased promise of ML in solving real problems and the experienced difficulty of their use, has this issue started to attract attention. This difficulty arises from the complexity of learning problems and the large variety of available techniques. In order to understand this complexity and begin to overcome it, it is important to construct a characterization of learning situations. Building on previous work that dealt with the practical use of ML, a set of dimensions is developed, contrasted with another recent proposal, and illustrated with a project on the development of a decision-support system for marine propeller design. The general research opportunities that emerge from the development of the dimensions are discussed. Leading toward working systems, a simple model is presented for setting priorities in research and in selecting learning tasks within large projects. Central to the development of the concepts discussed in this paper is their use in future projects and the recording of their successes, limitations, and failures.
Nine IM Accounts and Counting
Authors: Joe Hildebrand
Venue: Queue (2003)

Instant messaging (IM) has become nearly as ubiquitous as e-mail, in some cases—on your teenager’s computer, for example—far surpassing e-mail in popularity. But it has gone far beyond teenagers’ insular world to business, where it is becoming a useful communication tool.
Pseudo-random generators for all hardnesses
Authors: Christopher Umans
Venue: Journal of Computer and System Sciences (2003)

Given a function f:{0,1}log n → {0, 1} with circuit complexity s, we construct a pseudo-random generator that stretches a random seed of length O(logn) into a string of m = sΩ(1) pseudo-random bits that fool circuits of size m. The construction works for any hardness s, giving an optimal hardness vs. randomness tradeoff with a direct and self-contained proof. A key element in our construction is an augmentation of the standard low-degree extension encoding that exploits the field structure of the underlying space in a new way.
Towards a Standard EAI Quality Terminology
Authors: Francisca Losavio, Dinarle Ortega, María Pérez
Venue: Proceedings of the XXIII International Conference of the Chilean Computer Science Society (2003)

Since software integration research has yielded avariety of different concepts, we survey and discuss EAI(Enterprise Application Integration terminology, in thedomain of the quality properties, known as Quality ofServices (QoS) offered by the EAI middleware. The maingoal of this work is to establish a correspondence ormapping between the ISO standard definitions and theterminology used in the description of the QoS providedby the EAI middleware. Our aim is to give the EAIsoftware community an easy way to "standardize" andunify their terminology using our mapping, withoutloosing the advantage of using the current notionsemployed by users and practitioners. A standard qualitymodel, based on the ISO-9126-1 for EAI middleware andintegrated information systems (Enterprise Systems) hasbeen defined to achieve this goal. Our result can be usedas a basic element or starting point towards an ontologyfor software quality in the EAI domain.
Computational investigations of the Prouhet-Tarry-Escott problem
Authors: Peter Borwein, Petr Lisoněk, Colin Percival
Venue: Mathematics of Computation (2003)

We describe a method for searching for ideal symmetric solutions to the Prouhet-Tarry-Escott Problem. We report results of extensive searches for solutions of sizes up to 12. We found two solutions of size 10 that are smaller by two orders of magnitude than the solution found by A. Letac in the 1940s, which was the smallest size 10 solution known before our search.
Evaluation of boolean expressions on one's complement machines
Authors: Peter L. Montgomery
Venue: ACM SIGPLAN Notices (1978)

An algorithm is presented which evaluates an arbitrary boolean expression in terms of a small instruction set and which often generates fewer instructions than other methods the author has seen. The algorithm tells what code to generate whenever a boolean operator, a branch test, a boolean assignment statement, or a conditional expression is encountered. One's complement arithmetic is assumed throughout.
How shall we assess this?
Authors: Janet Carter, Kirsti Ala-Mutka, Ursula Fuller, Martin Dick, John English, William Fone, Judy Sheard
Venue: Working group reports from ITiCSE on Innovation and technology in computer science education (2003)

Increased class sizes are forcing academics to reconsider approaches to setting and marking assessments for their students. Distributed and distance learning are creating some of the biggest changes. Some educators are embracing new technologies but others are more wary of what they do not know. In order to address this issue it is first necessary to investigate the types of assessment currently in use and the perceptions that are held by academics with and without experience of the new technologies that are becoming available.In this paper we present the findings of an international survey of Computer Science academics teaching a variety of topics within the discipline. The findings are split into two sections: a snapshot of current assessment practices and an analysis of respondents' perceptions of Computer Aided Assessment (CAA). Academics' opinions about the advantages and disadvantages of CAA are split in line with level of experience of using such techniques. Those with no experience of CAA suggest that it cannot be used to test higher-order learning outcomes and that the quality of the immediate feedback is poor; these negative opinions diminish as experience is gained.
An Overview of Web Services Security
Authors: P. Kearney, J. Chapman, N. Edwards, M. Gifford, L. He
Venue: BT Technology Journal (2004)

Security and Web Services are consistently reported among the top technologies of interest to businesses. Concerns about security are a major deterrent to companies considering use of the technology. This paper attempts to give an overview of the current state of Web Services security. The main body of the paper is a tour through key concepts used in Web Services security. Examples based on software demonstrators built by the authors are used to explain how the ideas are used in combination to achieve particular aims. The state of play as regards standards is also reviewed. The concluding section gives some pointers as to active research topics.
Simulation Evaluation of Wireless Web Performance in an IEEE 802.11b Classroom Area Network
Authors: Guangwei Bai, Carey Williamson
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

This paper presents a simulation study of an IEEE802.11b wireless LAN (WLAN) used as a classroom areanetwork. The simulation is conducted using OPNET Modeler9.1. The first part of the paper discusses parameterizationand validation of the simulation model, based onempirical measurements in a wireless classroom environment.The second part of the paper presents a simulationstudy designed to estimate the number of clients that can besupported in the WLAN, as well as the user-perceived Webresponse time as a function of network load. The simulationresults show that an IEEE 802.11b WLAN can easilysupport up to 100 clients with modest Web browsing activities.The results also show that protocol features suchas persistent connections provide a significant performanceadvantage in a WLAN environment.
Playing hide-and-seek with correlations
Authors: Christopher Jermaine
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

We present a method for very high-dimensional correlation analysis. The method relies equally on rigorous search strategies and on human interaction. At each step, the method conservatively "shaves off" a fraction of the database tuples and attributes, so that most of the correlations present in the data are not affected by the decomposition. Instead, the correlations become more obvious to the user, because they are hidden in a much smaller portion of the database. This process can be repeated iteratively and interactively, until only the most important correlations remain.The main technical difficulty of the approach is figuring out how to "shave off" part of the database so as to preserve most correlations. We develop an algorithm for this problem that has a polynomial running time and guarantees result quality.
Scheduling Real-Time Dwells Using Tasks with Synthetic Periods
Authors: Chi-Sheng Shih, Sathish Gopalakrishnan, Phanindra Ganti, Marco Caccamo, Lui Sha
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

This paper addresses the problem of scheduling real-timedwells in multi-function phase array radar systems.To keep track of targets, a radar system must meet its timingand energy constraints. We propose a new task modelfor radar dwells to accurately characterize their timing parameters.We develop an algorithm of transforming everydwell task as a semi-period task so the dwell task can meetits timing constraint and the interarrival times of the taskmay not a constant. We also develop an enhanced template-basedscheduling algorithm to schedule such tasks to meetthe timing and energy constraints. Simulation results showthat this algorithm can significantly improve the resourceutilization.
A Framework for Measuring Business Processes Based on GQM
Authors: Lerina Aversano, Thierry Bodhuin, Gerardo Canfora, Maria Tortorella
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

The evolution of business processes and supporting software systems requires their analysis and assessment from both quantitative and qualitative points of view. The analysis and evaluation activities need the support of methodological and technological tools, customizable to the innovation requirements of the chosen processes and supporting software systems.This paper proposes a measurement framework based on the Goal-Question-Metric (GQM) paradigm. It is generally applicable to any business process and supporting software system after its instantiation. The collaborative software environment WebEv, Web for the Evaluation, is proposed for facilitating the collection and elaboration of the required measures. Finally, the paper describes the application of the measurement framework in a real context.
Extending the ODMG Object Model with Triggers
Authors: Elisa Bertino, Giovanna Guerrini, Isabella Merlo
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--In this paper, we extend the standard for object-oriented databases, ODMG, with reactive features, by proposing a language for specifying triggers and defining its semantics. This extension has several implications, thus this work makes three different specific contributions. First, the definition of a declarative data manipulation language for ODMG, which is missing in the current version of the standard; such a definition requires revisiting data manipulation in ODMG and also addressing issues related to set-oriented versus instance-oriented computation. Then, the definition of a trigger language for ODMG, unifying also the SQL:1999 proposal and providing support for trigger inheritance and overriding. Finally, the development of a formal semantics for the proposed data manipulation and trigger languages.
Modeling the detective quantum efficiency of scintillators used in medical imaging radiation detectors
Authors: A. Episkopakis, D. Nikolopoulos, K. Arvanitis, N. Dimitropoulos, G. Panayiotakis, D. Cavouras, I. Kandarakis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The purpose of this work was to model and compare the zero-frequency detective quantum efficiency (DQE(0)) of Gd2O2S:Tb, Gd2O2S:Eu Gd2O2S:Pr, Gd2O2S: Pr, Ce, F and YTaO4:Nb granular scintillators for use X-ray medical imaging detectors. The work uses a mathematical model based on a photon diffusion differential equation. X-ray tube voltage was considered to vary from 10 and 200 kV while phosphor screen thickness ranged between 10 and 160 mg/cm2 coating.
Aircraft and Gate Scheduling with Time Windows
Authors: Yi Zhu, Andrew Lim, Brian Rodrigues
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

In contrast to the existing airport gate assignment studies where flight have fixed schedules, we consider the more realistic situation where flight arrival and departure times can change. Our objectives are achieved through gate assignments where time slots alloted to aircraft at gates deviate from scheduled slots minimally. The solution approach uses insert and interval exchange moves together with a time shift algorithm. We then use these neighborhood movesin Tabu Search and Memetic Algorithms. Computational results are provided and verify that our heuristics work well in small cases and much better in large cases when compared with CPLEX solver.
Describing documents: what can users tell us?
Authors: Daniel Gonçalves, Joaquim A. Jorge
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

With the increasing number of computers per user, it has become common for most users to deal with growing numbers of electronic documents. Those documents are usually stored in hierarchic file systems, requiring them to be classified into the hierarchy, a difficult task. Such organization schemes do not provide adequate support for the efficient and effortless retrieval of documents at a later time, since their position in the hierarchy is one of the only clues to a document's whereabouts. However, humans are natural-born storytellers, and stories help relate and remember important pieces of information. Hence, the usage of narratives where a user "tells a story" about the document will be a valuable tool towards simplifying the retrieval task.To find out if there are common patterns in stories about documents, we performed a study where 60 such stories were collected and analyzed. We identified the most common story elements (time, storage and purpose) and how they are likely to relate in typical stories. This preliminary study suggests that it is possible to infer archetypical stories. Further, we present a set of guidelines for the design of narrative-based document retrieval interfaces.
Object-oriented processor requirements with instruction analysis of Java programs
Authors: Mok Pak Lun, Anthony Fong, Gary K. W. Hau
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Application development adopts the concept of Object-Oriented Programming (OOP) in order to achieve better organization in module partitioning. OOP have three tenets, which are encapsulation, inheritance, and polymorphism. These tenets in OOP offer the program with enhanced security, organized partitioning, data hiding and code sharing, etc. In OOP system, programs perform as objects in the system. An application can be defined into different classes, or object templates, where each class shares some responsibility of the application. In the current practice, OOP system is based on a non-OOP processor. This approach generates overhead on the mapping of OOP features to the non-OOP processor. Therefore, there is need of OOP processor for the OOP system.Java is one of the most popular OOP languages today. Its portability, sharing ability, security, and integration of Internet make it a great success in software development, especially on network computing. In this paper, we will investigate the instruction behavior of some Java programs and benchmarks. By doing the instruction analysis of java programs, we can specify what is needed in an OOP processor in order to provide a fully OOP system in both hardware and software.
Techniques for automatically sizing multiple buffer pools in DB2
Authors: Wenhu Tian, Pat Martin, Wendy Powley
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

DB2 Universal Database (DB2/UDB) divides the buffer area into a number of independent buffer pools and each database object (table or index) is assigned to a specific buffer pool. Buffer pool sizing, which sets an appropriate size for each of the buffer pools is crucial for achieving optimal performance.In this paper, we investigate the buffer pool sizing problem. Two cost models, which are based on page fault and data access time, are examined. A greedy algorithm is proposed to search for the optimal solution. We study the effectiveness of the above techniques using experiments with the TPC-C benchmark database. The results show that the data access time based cost model is more effective for optimizing the buffer pool sizes than the page fault based cost model.
Are Our Design for Testability Features Fault Secure?
Authors: C. Metra, T. M. Mak, M. Omaña
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

We analyze the risks associated with faults affecting some common Design For Testability (DFT) features employed within digital products. We will show that some DFT structures may become useless, with consequent dramatic impact on test effectiveness and product quality. We borrow the Fault Secure property and we will show that it guarantees that no escapes or false acceptance of faulty products may occur because of faults within the DFT structures.