ppxscal/embedding_network huggingface dataset:
Pointed and colored binary encompassing trees
Authors: Michael Hoffmann, Csaba D. Tóth
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

For n disjoint line segments in the plane we construct in optimal O(n log n) time an encompassing tree of maximum degree three such that at every vertex all incident edges lie in a halfplane defined by the incident input segment. In particular, this implies that each vertex is pointed. Furthermore, we show that any set of colored disjoint line segments (for each segment one endpoint is colored red and the other endpoint is colored blue) has an encompassing tree of maximum degree three in which no edge is monochromatic.
Cluster of re-configurable nodes for scanning large genomic banks
Authors: Stéphane Guyetant, Mathieu Giraud, Ludovic L'Hours, Steven Derrien, Stéphane Rubini, Dominique Lavenier, Frédéric Raimbault
Venue: Parallel Computing (2005)

Genomic data are growing exponentially and are daily scanned by thousands of biologists. To reduce the scan time, efficient parallelism can be exploited by dispatching data among a cluster of processing units able to scan locally and independently their own data. If PC clusters are well suited to support this type of parallelism, we propose to substitute PCs by re-configurable hardware closely connected to a hard disk. We show that low cost FPGA nodes interconnected through a standard Ethernet network may advantageously compete against high performance clusters. A prototype of 48 re-configurable processing nodes has been experimented on two genomic applications: a content-based similarity search and a pattern search.
Interest management middleware for networked games
Authors: Graham Morgan, Fengyun Lu, Kier Storey
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

In this paper we present an implementation of an interest management scheme using standard message oriented middleware (MOM) technologies to provide scalable message dissemination for networked games. The aim of all interest management schemes is to identify when objects that inhabit a virtual world should be interacting and to enable such interaction via message passing while preventing objects that should not be interacting from exchanging messages. The time taken by existing interest management schemes to resolve which objects influence each other may be too large to enable the desired interaction to occur. Furthermore, existing interest management implementations tend to be proprietary and are built directly on top of networking protocols. In this paper we present an approach to interest management based on the predicted movement of objects. Our approach determines the frequency of message exchange between objects on the likelihood that such objects will influence each other in the near future. We then demonstrate, via implementation and experimentation, how existing middleware standards provide a suitable platform for the deployment of our interest management scheme.
Dynamic speedometer: dashboard redesign to discourage drivers from speeding
Authors: Manu Kumar, Taemie Kim
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We apply HCI design principles to redesign the dashboard of the automobile to address the problem of speeding. We prototyped and evaluated a new speedometer designed with the explicit intention of changing drivers' speeding behavior. Our user-tests show that displaying the current speed limit as part of the speedometer visualization (i.e. the dynamic speedometer) results in safer driving behavior. Designing with the intent to achieve a particular behavior can be an effective approach for increasing the safety of mission-critical systems. This is an area in which HCI designers can have a significant impact.
Geographically Distributed System for Catastrophic Recovery
Venue: Proceedings of the 16th USENIX conference on System administration (2002)

This paper presents the results of a proof-of-concept implementation of an on-going project to create a cost effective method to provide geographic distribution of critical portions of a data center along with methods to make the transition to these backup services quick and accurate. The project emphasizes data integrity over timeliness and prioritizes services to be offered at the remote site. The paper explores the tradeoff of using some common clustering techniques to distribute a backup system over a significant geographical area by relaxing the timing requirements of the cluster technologies at a cost of fidelity.The trade-off is that the fail-over node is not suitable for high availability use as some loss of data is expected and fail-over time is measured in minutes not in seconds. Asynchronous mirroring, exploitation of file commonality in file updates, IP Quality of Service and network efficiency mechanisms are enabling technologies used to provide a low bandwidth solution for the communications requirements. Exploitation of file commonality in file updates decreases the overall communications requirement. IP Quality of Service mechanisms are used to guarantee a minimum available bandwidth to ensure successful data updates. Traffic shaping in conjunction with asynchronous mirroring is used to provide an efficient use of network bandwidth.Traffic shaping allows a maximum bandwidth to be set minimizing the impact on the existing infrastructure and provides a lower requirement for a service level agreement if shared media is used. The resulting disaster recovery site, allows off-line verification of disaster recovery procedures and quick recovery times of critical data center services that is more cost effective than a transactionally aware replication of the data center and more comprehensive than a commercial data replication solution used exclusively for data vaulting. The paper concludes with a discussion of the empirical results of a proof-of-concept implementation.
Dear Editor
Authors: Diomidis Spinellis
Venue: IEEE Software (2005)

Using an editor to help with programming can save time and effort. This column discusses some of the ways editors can help as well as pitfalls programmers should avoid.
A software tool in Java for teaching CPU scheduling
Authors: Tat W. Chan
Venue: Journal of Computing Sciences in Colleges (2004)

This paper describes a concept-specific simulator designed for teaching CPU scheduling in operating system courses. The simulator takes the execution information of a set of processes as input. It outputs a report showing the wait time, termination time, turnaround time of each process, the system's average wait time, and the system's average turnaround time.
Dealing with system response times in interactive speech applications
Authors: Peter Fröhlich
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In this user study, we address several open issues in the design of waiting cues for system response time (SRT) in interactive telephony speech applications. User observations and structured preference tests indicate that silent waiting times should not be longer than 4 -- 8 seconds. Already at short durations, music combined with speech was favored to silence. A preference test regarding several non-speech waiting cues proposed in literature suggests that music is preferred to more simple synthetic sounds and to natural sounds. The continuous indication of the remaining waiting time by speech was rated as much more pleasant and appropriate than a non-speech audio progress meter. Commercial announcements and navigational advice during waiting times were not accepted by the subjects. Empirically based guidelines for a maximum waiting duration in voice services is given. Implications for the design of auditory waiting cues for SRT are discussed.
An automatic fiber alignment system using genetic algorithms
Authors: Masahiro Murakawa, Yoshihiro Noda, Tetsuya Higuchi
Venue: Systems and Computers in Japan (2004)

In this paper, the authors propose an automatic optical fiber alignment method using genetic algorithms and develop a fiber alignment system to verify its effectiveness. The theory for connecting optical fibers basically differs from the theory for connecting conventional metallic-core wires because the coupling faces must be completely aligned with submicrometer precision. As a result, even manual fiber alignment takes an extremely long time unless an expert with experience and technical proficiency is doing it. To resolve this problem, some attempts have been made to develop automatic fiber alignment systems. However, these systems are not yet practical because the fiber alignment time increases too much as the number of degrees of freedom of the optical fiber coupling faces increases. Therefore, in this paper, the authors developed an automatic fiber alignment system using genetic algorithms, which are efficient search techniques, to implement fiber alignment with many degrees of freedom. Experimental results showed that fiber alignment with five degrees of freedom, which was difficult conventionally, could be completed within a practical interval of approximately 3 minutes. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(11): 80&ndash;90, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10035
CSMS'93---COMPUTER-BASED MEDICAL SYSTEMS
Authors: John Kruse
Venue: ACM SIGCHI Bulletin (1993)

The Sixth Annual IEEE Symposium on Computer-Based Medical Systems (CBMS '93) was held in Ann Arbor, Michigan, on June 13--16, 1993. Much of the conference focused on how to develop medical systems which are safe and usable. Tutorials covered 1) software quality assurance, including improved processes for software development, 2) industrial design, which included processes for incorporating the needs of customers and users early in the design process, and 3) Quality Function Deployment, which is a structured approach to tracking the relationship between users' needs and technical measures of a product.
Permutation statistics and the q, t-Catalan sequence
Authors: Nicholas A. Loehr
Venue: European Journal of Combinatorics (2005)

The Catalan numbers occur ubiquitously in combinatorics. R. Stanley's book Enumerative Combinatorics 2 (1999) and its addendum (http://www-math.mit.edu/~rstan/ec/catadd.pdf) list over 95 collections of objects counted by the Catalan numbers. We augment this list with two additional collections of permutations that are enumerated by the Catalan numbers. Furthermore, we show that the generating function for either collection, relative to the classical coinversion and major index statistics, is precisely the q, t-Catalan sequence of Garsia and Haiman. This is proved by exhibiting weight-preserving bijections between the given collections and the set of Dyck paths. The bijections are based on encodings of Dyck paths and permutations as sequences of partitions.
An enhanced multitap text entry method with predictive next-letter highlighting
Authors: Jun Gong, Bryan Haggerty, Peter Tarasewich
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Full keyboards are difficult to implement on small mobile devices, and are sometimes replaced by keypads, with multiple characters assigned to each key. The Multitap method is often used for text entry on devices with keypads. While conceptually simple, Multitap requires one or more key presses to enter each desired letter, and is relatively inefficient from the standpoint of the number of keystrokes required to enter each word. It also requires a significant amount of visual searching to find a needed letter on a key. Fortunately, newer methods based on Multitap (such as LetterWise) have been shown to increase users' text entry efficiency. This paper presents an enhanced Multitap method that uses predictive next-letter highlighting to aid visual searching. Testing shows that this method, when compared to LetterWise, offers increased text entry speeds, fewer errors, and greater novice user satisfaction.
A Distributed Procedure for Bandwidth-Centric Scheduling of Independent-Task Applications
Authors: Cyril Banino
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication times. The single-port, full overlap model is used for modeling the activities of the nodes. A distributed method for determining the maximum steady-state throughput of a tree is presented. Then, we show how each node can build up its own local schedule independently of the rest of the platform. In addition, the final schedule is asynchronous and event-driven, meaning that each node (except the root) acts without any time-related information. A local scheduling strategy which aims at minimizing the amount of tasks buffered at node locations during steady-state is introduced. As a consequence, the lengths of the start-up and winddown phases are considerably reduced.
Knowledge Discovery from Transportation Network Data
Authors: Wei Jiang, Jaideep Vaidya, Zahir Balaporia, Chris Clifton
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Transportation and Logistics are a major sector of the economy, however data analysis in this domain has remained largely in the province of optimization. The potential of data mining and knowledge discovery techniques is largely untapped. Transportation networks are naturally represented as graphs. This paper explores the problems in mining of transportation network graphs: We hope to find how current techniques both succeed and fail on this problem, and from the failures, we hope to present new challenges for data mining. Experimental results from applying both existing graph mining and conventional data mining techniques to real transportation network data are provided, including new approaches to making these techniques applicable to the problems. Reasons why these techniques are not appropriate are discussed. We also suggest several challenging problems to precipitate research and galvanize future work in this area.
Comment on "Integer Arithmetic" by Hodge
Authors: Paul E. Kenison
Venue: ACM SIGSMALL/PC Notes (1989)

The other day, I finally got to read some back issues of journals to which I subscribe. One of these journals is SIGSMALL/PC Notes. In the most recent issue (May 1989) I read your article about "Integer Arithmetic." In looking at the article I noted that you had indicated that you hadn't proven the induction assumption that you had used. I thought that I would take a few minutes and look at a possible proof. I believe that I found a proof that is rather simple. It all falls out rather easily when the expression is represented in factorial notation. 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
ROC `n' Rule Learning&mdash;Towards a Better Understanding of Covering Algorithms
Authors: Johannes Fürnkranz, Peter A. Flach
Venue: Machine Learning (2005)

This paper provides an analysis of the behavior of separate-and-conquer or covering rule learning algorithms by visualizing their evaluation metrics and their dynamics in coverage space, a variant of ROC space. Our results show that most commonly used metrics, including accuracy, weighted relative accuracy, entropy, and Gini index, are equivalent to one of two fundamental prototypes: precision, which tries to optimize the area under the ROC curve for unknown costs, and a cost-weighted difference between covered positive and negative examples, which tries to find the optimal point under known or assumed costs. We also show that a straightforward generalization of the m-estimate trades off these two prototypes. Furthermore, our results show that stopping and filtering criteria like CN2's significance test focus on identifying significant deviations from random classification, which does not necessarily avoid overfitting. We also identify a problem with Foil's MDL-based encoding length restriction, which proves to be largely equivalent to a variable threshold on the recall of the rule. In general, we interpret these results as evidence that, contrary to common conception, pre-pruning heuristics are not very well understood and deserve more investigation.
Designing A Disjoint Paths Interconnection Network with Fault Tolerance and Collision Solving
Authors: Ching-Wen Chen, Chung-Ping Chung
Venue: The Journal of Supercomputing (2005)

In fault-tolerant interconnection designs, many prior researches suggest good use of disjoint paths to improve the reliability of interconnection networks. Although disjoint paths increase reliability, they always cost the throughput penalty. To address the problems of both performance and fault-tolerant capability, the following issues should be carefully considered: (1) guarantee of at least two disjoint paths, (2) easy rerouting between disjoint paths, (3) keep low rerouting hops, (4) solve the occurrences of packets' collision. In this paper, we consider these issues to design a fault-tolerant network called CSMIN (Combining Switches Multistage Interconnection Network). CSMIN provides two disjoint paths to guarantee one fault-tolerant and can dynamically reroute packets between these two paths to solve the collision situation. In other words, to switch packets between these two disjoint paths easily, CSMIN causes these two disjoint paths to have regular distances at each stage. Accordingly, a packet can be dynamically sent to the other disjoint path if it encounters a faulty or busy element. In addition, CSMIN presents low rerouting hops (an average of one rerouting hop) to maintain a low collision ratio. From the simulation result, CSMIN performs with a better arrival ratio than Gamma and other related disjoint paths networks do.
Book review: Using Novell Netware by Bill Lawrence (Que Books)
Venue: ACM SIGSMALL/PC Notes (1991)

I must say I was pleasantly surprised when I read "Using Novell Netware". It's mistitled perhaps, because it deals entirely with the installation of networks and the network administration thereof. Yet it's certainly a book I wish I had when I was dealing with my first network. 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
Power-delay optimization of D-latch&#x002F;MUX source coupled logic gates: Research Articles
Authors: M. Alioto, G. Palumbo
Venue: International Journal of Circuit Theory and Applications (2005)

In this paper a design strategy for MUX, XOR and D-latch source coupled logic (SCL) gates is proposed. To this end, an analytical model of the delay and the noise margin as a function of the transistors' aspect ratio and bias current is first introduced. Successively, analytical equations of the transistors' aspect ratio to meet a given noise margin specification are derived as a function of the bias current, and are then used along with the delay model to express the delay as an explicit function of the bias current and noise margin.The simplified delay expression explicitly relates speed performance to power dissipation and the noise margin, thereby providing the designer with the required understanding of the trade-offs involved in the design. Therefore, the criteria proposed allow the designer to consciously manage the power-delay trade-off. The delay dependence on the logic swing is also investigated with results showing that this delay is not necessarily reduced by reducing the logic swing, in contrast with the usual assumption. Since the results obtained are valid for all SCL gates and are independent of the CMOS process used, the guidelines provided afford a deeper understanding of SCL gates from a design point of view. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Enabling technologies for the &lsquo;always best connected&rsquo; concept: Research Articles
Authors: Nikos Passas, Sarantis Paskalis, Alexandros Kaloxylos, Faouzi Bader, Renato Narcisi, Evangelos Tsontsis, Adil S. Jahan, Hamid Aghvami
Venue: Wireless Communications Mobile Computing (2005)

&lsquo;Always Best Connected&rsquo; (ABC) is considered one of the main requirements for next generation networks. The ABC concept allows a person to have access to applications using the devices and network technologies that best suits his or her needs or profile at any time. Clearly, this requires the combination of a set of existing and new technologies, at all levels of the protocol stack, into one integrated system. In this paper, a considerable set of the technologies, that are expected to play a key role towards the ABC vision, are presented. Starting from a reference architecture, the paper describes the required enhancements at certain levels of a traditional protocol stack, as well as technologies for mobility and end-to-end Quality of Service (QoS) support. The paper concludes with a case study that reveals the advantages of the ABC concept. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Using Privacy Policies to Protect Privacy in UBICOMP
Authors: George Yee
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

With the increasing deployment of sensors, intelligent devices of all sizes, and wireless networking, ubiquitous computing environments are getting closer and closer to reality. Research in UBICOMP has focused on enabling technologies, such as networking, data management, security, and user interfaces [1]. However, privacy for UBICOMP has been a contentious issue and the privacy concerns that have been raised suggest that privacy may be the greatest barrier to the long-term success of UBICOMP [2]. In this paper, we propose that privacy in UBICOMP can be managed using privacy policies. We propose a UBICOMP model for protecting privacy using privacy policies and derive the content of a UBICOMP privacy policy.
Multiple-Valued Duplex Asynchronous Data Transfer Scheme for Interleaving in LDPC Decoders
Authors: Naoya Onizawa, Akira Mochizuki, Takahiro Hanyu, Vincent C. Gaudet
Venue: Proceedings of the 35th International Symposium on Multiple-Valued Logic (2005)

A novel duplex asynchronous data-transfer scheme based on multiple-valued encoding is proposed for interleaving in Low-Density Parity-Check (LDPC) decoders, where high-throughput interleavers between variable and check nodes without clock-distribution problems are highly advantageous. Since control signals and data from mutual nodes are multiplexed using a multi-level dual-rail codeword, the number of communication steps can be greatly reduced, which results in high-speed communication without any additional wires. The hardware is simply implemented by utilizing a multiple-valued current-mode circuit because all the information can be superposed on the same line. The advantages of the proposed asynchronous data-transfer scheme are discussed in comparison with corresponding synchronous and conventional asynchronous schemes.