ppxscal/embedding_network huggingface dataset:
Algorithm based on taboo search and shifting bottleneck for job shop scheduling
Authors: Wen-Qi Huang, Zhi Huang
Venue: Journal of Computer Science and Technology (2004)

In this paper, a computational effective heuristic method for solving the minimum makespan problem of job shop scheduling is presented. It is based on taboo search procedure and on the shifting bottleneck procedure used to jump out of the trap of the taboo search procedure. A key point of the algorithm is that in the taboo search procedure two taboo lists are used to forbid two kinds of reversals of arcs, which is a new and effective way in taboo search methods for job shop scheduling. Computational experiments on a set of benchmark problem instances show that, in several cases, the approach, in reasonable time, yields better solutions than the other heuristic procedures discussed in the literature.
Adaptive Book: Teaching and Learning Environment for Programming Education
Authors: Victor Adamchik, Ananda Gunawardena
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper, we present another yet approach to a content-delivery mechanism for designing and teaching programming courses. The approach is based on utilizing the electronic Adaptive Book that delivers just-in-time interactive learning modules to individual students and thus results in a more efficient teaching process. Initially motivated by merging the process of teaching and learning into one integrated environment, our model provides customization (instructor's view) and personalization (student's view) of content. This knowledge-transfer environment is assembled using a repository of learning objects. The Adaptive Book technology allows utilization of any repository of IMS/SCORM compatible content.
Beyond Relational Databases
Authors: Margo Seltzer
Venue: Queue (2005)

There is more to data access than SQL. The number and variety of computing devices in the environment are increasing rapidly. Real computers are no longer tethered to desktops or locked in server rooms. PDAs, highly mobile tablet and laptop devices, palmtop computers, and mobile telephony handsets now offer powerful platforms for the delivery of new applications and services. These devices are, however, only the tip of the iceberg. Hidden from sight are the many computing and network elements required to support the infrastructure that makes ubiquitous computing possible.
Contiguous Search in the Hypercube for Capturing an Intruder
Authors: Paola Flocchini, Miao Jun Huang, Flaminia L. Luccio
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In this paper we consider the problem of searching for an intruder in a network.There is a team of collaborative software agents that are deployed to capture a hostile intruder (e.g., a virus).These agents asynchronously move along the network links and the intruder has the capability of escaping arbitrarily fast.We propose two different strategies for the solution of the problem in a widely studied topology: the hypercube network.In the first strategy one of the agents acts as a coordinator making the other agents move in a precise way; this strategy requires O(n log n) moves, a team of O(\frac{n}{{n\log n}}) agents and runs in O(n log n) time steps.The second strategy is devised for a model where the agents are allowed to "see" the state of their neighbours.In this case, the computation is local, i.e., there is no need of a coordinator and agents can move automously.In this setting the solution requires \frac{n}{2} agents, but is much faster (log n time steps), and requires the same number of moves (O(n log n)).
A Random Version of Shepp's Urn Scheme
Authors: Robert W. Chen, Alan Zame, Chien-Tai Lin, Hsiu-fen Wu
Venue: SIAM Journal on Discrete Mathematics (2005)

In this paper, we consider the following random version of Shepp's urn scheme: A player is given an urn with n balls. p of these balls have value +1 and n-p have value -1. The player is allowed to draw balls randomly, without replacement, until he or she wants to stop. The player knows n, the total number of balls, but knows only that p, the number of balls of value +1, is a number selected randomly from the set {0, 1,2,...,n}. The player wishes to maximize the expected value of the sum of the balls drawn. We first derive the player's optimal drawing policy and an algorithm to compute the player's expected value at the stopping time when he or she uses the optimal drawing policy. Since the optimal drawing policy is rather intricate and the computation of the player's optimal expected value is quite cumbersome, we present a very simple drawing policy, which is asymptotically optimal. We also show that this random urn scheme is equivalent to a random coin tossing problem.
Languages of the future
Authors: Tim Sheard
Venue: ACM SIGPLAN Notices (2004)

This paper explores a new point in the design space of formal reasoning systems - part programming language, part logical framework. The system is built on a programming language where the user expresses equality constraints between types and the type checker then enforces these constraints. This simple extension to the type system allows the programmer to describe properties of his program in the types of witness objects which can be thought of as concrete evidence that the program has the property desired. These techniques and two other rich typing mechanisms, rank-N polymorphism and extensible kinds, create a powerful new programming idiom for writing programs whose types enforce semantic properties.A language with these features is both a practical programming language and a logic. This marriage between two previously separate entities increases the probability that users will apply formal methods to their programming designs. This kind of synthesis creates the foundations for the languages of the future.
Natural language queries: an interpreter for the Italian Language: Unversita di Torino, Italy
Authors: Leonardo Lesmo, Piere Torasso
Venue: Issue 79 (January 1982) (1982)

In the past two years a system has been implemented which accepts as input a query in Italian and produces a representation of the query which is easily interpretable as a sequence of algebraic operations on a relational data base /1/. The main features of the system can be summarized as:
Too much information
Authors: Richard Mateosian
Venue: IEEE Micro (2005)

Sometimes the stack of interesting books gets too tall. I can only review a few each time, but there are many more that are too good to pass over. This time I look briefly at a number of books I wish I could spend more time with.
Augmenting LZ-77 with authentication and integrity assurance capabilities: Research Articles
Authors: Mikhail J. Atallah, Stefano Lonardi
Venue: Concurrency and Computation: Practice Experience (2004)

The formidable dissemination capability allowed by the current network technology makes it increasingly important to devise new methods to ensure authenticity and integrity. Nowadays it is common practice to distribute documents in compressed form. In this paper, we propose a simple variation on the classic LZ-77 algorithm that allows one to hide, within the compressed document, enough information to warrant its authenticity and integrity. The design is based on the unpredictability of a certain class of pseudo-random number generators, in such a way that the hidden data cannot be retrieved in a reasonable amount of time by an attacker (unless the secret bit-string key is known). Since it can still be decompressed by the original LZ-77 algorithm, the embedding is completely &lsquo;transparent&rsquo; and backward-compatible, making it possible to deploy it without disrupting service. Experiments show that the degradation in compression due to the embedding is almost negligible. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Von Mises/Tikhonov-based distributions for systems with differential phase measurement
Authors: Yuriy S. Shmaliy
Venue: Signal Processing (2005)

The von Mises/Tikhonov probability density function (pdf) is examined to use as an approximation for the differential phase in presence of Gaussian noise in systems with differential phase measurement (DPM). It is shown that this approximation is the best fit for the phase difference between two vectors with equal signal-to-noise ratios (SNRs). The strategy is proposed to derive the approximate pdf for the case of infinite SNR in one of the vectors. Two approximating pdfs are derived for the differential phase diversity with different and equal SNRs. An application is given for the error probability in passive wireless remote SAW sensing with DPM.
Fredkin Match at IJCAI-81
Authors: Hans Berliner
Venue: Issue 80 (April 1982) (1982)

The 1981 Fredkin Match was between Belle, the winner of all recent computer chess competitions and Carl Storey, a Canadian Master with a rating of 2204. A master was chosen for the first time in this series of competitions since Belle was clearly in a class by itself and had already beaten more Masters that it had lost to. However, Mr. Storey prepared himself very well for this match, and unlike his predecessors in the 1980 Fredkin Matches proved to be completely dominant.
Modelling Dynamic Scenes by Registering Multi-View Image Sequences
Authors: Jean-Philippe Pons, Renaud Keriven, Olivier Faugeras
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper, we present a new variational method for multi-view stereovision and non-rigid three-dimensional motion estimation from multiple video sequences. Our method minimizes the prediction error of the shape and motion estimates. Both problems then translate into a generic image registration task. The latter is entrusted to a similarity measure chosen depending on imaging conditions and scene properties. In particular, our method can be made robust to appearance changes due to non-Lambertian materials and illumination changes. It results in a simpler, more flexible, and more efficient implementation than existing deformable surface approaches. The computation time on large datasets does not exceed thirty minutes. Moreover, our method is compliant with a hardware implementation with graphics processor units. Our stereovision algorithm yields very good results on a variety of datasets including specularities and translucency. We have successfully tested our scene flow algorithm on a very challenging multi-view video sequence of a non-rigid scene.
Optimum and heuristic synthesis of multiple word-length architectures
Authors: George A. Constantinides, Peter Y. K. Cheung, Wayne Luk
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2005)

This paper explores the problem of architectural synthesis (scheduling, allocation, and binding) for multiple word-length systems. It is demonstrated that the resource allocation and binding problem, and the interaction between scheduling, allocation, and binding, are complicated by the existence of multiple word-length operators. Both optimum and heuristic approaches to the combined problem are formulated. The optimum solution involves modeling as an integer linear program, while the heuristic solution considers intertwined scheduling, binding, and resource word-length selection. Techniques are introduced to perform scheduling with incomplete word-length information, to combine binding and word-length selection, and to reline word-length information based on critical path analysis. Results are presented for several benchmark and artificial examples, demonstrating significant resource savings of up to 46% are possible by considering these problems within the proposed unified framework.
Why CHI fragmented
Authors: Jonathan Grudin
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

I have been active in SIGCHI since 1983, serving on the Executive Committee and many conference and program committees. After editing ACM TOCHI for six years, I explored the history of CHI and related fields. The "conference-centered" model unique to U.S. computer science, wherein little published research reaches journals, and uncertainty regarding HCI's academic niche have created an unusual situation. I propose some paths forward.
Coupon replication systems
Authors: Laurent Massoulié, Milan VojnoviĆ
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

Motivated by the study of peer-to-peer file swarming systems à la BitTorrent, we introduce a probabilistic model of coupon replication systems. These systems consist of users, aiming to complete a collection of distinct coupons. Users are characterised by their current collection of coupons, and leave the system once they complete their coupon collection. The system evolution is then specified by describing how users of distinct types meet, and which coupons get replicated upon such encounters.For open systems, with exogenous user arrivals, we derive necessary and sufficient stability conditions in a layered scenario, where encounters are between users holding the same number of coupons. We also consider a system where encounters are between users chosen uniformly at random from the whole population. We show that performance, captured by sojourn time, is asymptotically optimal in both systems as the number of coupon types becomes large.We also consider closed systems with no exogenous user arrivals. In a special scenario where users have only one missing coupon, we evaluate the size of the population ultimately remaining in the system, as the initial number of users, N, goes to infinity. We show that this decreases geometrically with the number of coupons, K. In particular, when the ratio K/log(N) is above a critical threshold, we prove that this number of left-overs is of order log(log(N)).These results suggest that performance of file swarming systems does not depend critically on either altruistic user behavior, or on load balancing strategies such as rarest first.
Guide to the Best and Worst HPCMP Systems for Executing Individual TI-04 Benchmarking Applications and Synthetics
Authors: Roy L. Campbell,  Jr.
Venue: Proceedings of the 2004 Users Group Conference (2004)

Since time-to-solution and processor scalability of an application can vary greatly from one architecture to another, it is important to consider the suitability of each system with respect to that application in order to make efficient use of available resources. Given that the full set of possible applications is quite large, this paper focuses on those applications within the FY-04 technology insertion (TI-04) benchmarking suite - AERO, COBALT-60, GAMESS, HYCOM, NAMD, OOCore, and RF-CTH - for which all except AERO have a standard and large test case. Both the overall performance and performance per processor of the High Performance Computing Modernization Program's (HPCMP's) major systems are analyzed for each test case in order to provide general selection guidance to users and a unique perspective for code developers. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Constrained optimization by &alpha; constrained genetic algorithm (&alpha;GA)
Authors: Tetsuyuki Takahama, Setsuko Sakai
Venue: Systems and Computers in Japan (2004)

In this study, &alpha; constrained genetic algorithm (&alpha;GA) which solves constrained optimization problems is proposed. Constrained optimization problems, where the objective functions are minimized under given constraints, are very important and frequently appear in the real world. Recently, researches on constrained optimization using genetic algorithm (GA) have been widely carried out, and their results are equivalent to those by existing mathematical methods. &alpha;GA is a method which combines the &alpha; constrained method with GA. In the &alpha; constrained method, the satisfaction level of constraints to express how much a search point satisfies the constraints is introduced. The &alpha; level comparison which compares the search points based on the satisfaction level of constraints is also introduced. The &alpha; constrained method can convert constrained problems to unconstrained problems using &alpha; level comparison. In &alpha;GA, the individuals who satisfy the constraints will evolve to optimize the objective function and the individuals who do not satisfy the constraints will evolve to satisfy the constraints, naturally. In this paper, the effectiveness of &alpha;GA is shown by comparing &alpha;GA with GENOCOP 5.0 on various types of test problems, such as a linear programming problem, nonlinear programming problems, and problems with nonconvex constraints. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(5): 11&ndash;22, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10562
Medical Diagnostic Image Fusion Based on Feature Mapping Wavelet Neural Networks
Authors: Q. P. Zhang, M. Liang, W. C. Sun
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In recent years, many solutions to medical diagnostic image fusion have been proposed; however, it is difficult to simulate the surgical ability of image fusion when algorithms of image processing are piled up merely. On the basis of the review of researches on psychophysics and physiology of human vision, this paper presents an effective multi-resolution image fusion methodology, which is self-organizing feature mapping wavelet neural network (SOFMWNN), to simulate the processes of images recognition and understanding implemented in the human vision system. As an example, the fusion process is applied in the clinical case: the study of some particular disease by MR/SPECT fusion. Results are presented and evaluated, and a preliminary clinical validation is achieved. The effectiveness of the proposed model is demonstrated via results comparison with several other image fusion methods.
Packet- vs. Session-Based Modeling for Intrusion Detection Systems
Authors: Bruce D. Caulkins, Joohan Lee, Morgan Wang
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In today's interconnected networks, Intrusion Detection Systems (IDSs), encryption devices, firewalls and other hardware and software solutions are critical in providing complete security solutions for corporations and government agencies. Many IDS variants exist which allow security personnel to identify attack network packets primarily through the use of signature detection where the IDS "recognizes" attack packets due to their well-known signatures as those packets cross the network's gateway threshold. However, anomaly-based ID systems identify normal traffic within a network and report abnormal behavior. We report the findings of our research in the area of anomaly-based intrusion detection systems using data-mining techniques to create a decision tree model of our network using the 1999 DARPA Intrusion Detection Evaluation data set. After the model was created, we gathered data from our local campus network and scored the new data through the model using both packet-based and session-based modeling and compare the results.
Tangible newspaper for the visually impaired users
Authors: Adam J. Sporka, Vladislav Němec, Pavel Slavík
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper outlines a novel interaction technique allowing the visually impaired users to examine the layout of complex paper documents (e.g. a newspaper page). The document is placed on a desk in the view of a camera placed above it. The tip of user's index finger is tracked by means of algorithms of computer vision. As the user moves the finger over the document, the layout of its logical units (articles) is revealed by means of a simple sonification of their boundaries and the speech synthesis. In the paper, implementation of the test application is described and evaluated. The main advantage of our system is the direct mapping of the kinaesthetic experience to the layout of the physical document, enabling the user to employ any strategy to traverse the document. The prototype has been implemented using the ARToolKit library.
Demand-wise Shared Protection for Meshed Optical Networks
Authors: Arie M. Koster, Adrian Zymolka, Monika Jäger, Ralf Hülsermann
Venue: Journal of Network and Systems Management (2005)

In this paper, a new shared protection mechanism for meshed optical networks is presented. Significant network design cost reductions can be achieved in comparison to the well-known 1+1 protection scheme. Demand-wise Shared Protection (DSP) is based on the diversification of demand routings and exploits the network connectivity to restrict the number of backup lightpaths needed to provide the desired level of protection. Computational experiments illustrate the benefits of the DSP concept for cost efficient optical network designs.
The influence of environmental context on women in the IT workforce
Authors: Eileen M. Trauth, Jeria L. Quesenberry, Benjamin Yeo
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

In an effort to better understand the under representation of women in the IT field, the focus of research has been on the collection and analysis of empirical data. However, there is also a need for appropriate theory to understand and explain that data. Toward this end, Trauth has engaged in a program of research directed at the articulation of an empirically-grounded theory to explain and predict the under representation of women in the IT field. Called The Individual Differences Theory of Gender and IT, this theory argues that the under representation of women in IT is better accounted for by understanding the variation across women than by focusing on ascribed differences between men and women in stereotype. To this end, a set of constructs has been identified, including: personal data, shaping and influencing factors and environmental context. This set of constructs is being used as the interpretive vehicle in a multi-year study of the life histories of women IT professionals. The results, to date, have addressed the personal data, and shaping and influencing factors. The purpose of this paper is to examine the construct: environmental context. The results suggest that economic factors such as size of the information economy, household income and cost of living, and cultural factors such as attitudes and values regarding women, women working and women working in IT do exert an influence on the experience of women in the IT workforce. Thus, the data analysis presented in this paper serves to further supports this emerging theory of individual differences of gender and IT and its constructs.