ppxscal/embedding_network huggingface dataset:
Some experiments with computing the complex absolute value
Authors: John A. Wisniewski
Venue: ACM SIGNUM Newsletter (1978)

Portability for the numerical analyst not only includes writing codes which will compile and execute on a variety of machines, but also writing codes which are robust and accurate as well. This is particularly important for the computation of the complex absolute value. This computation, the computation of the 2-norm of a 2-vector, also occurs in the formation of Givens transformations [3] which are used in the solution of the symmetric eigenvalue problem, the computation of the singular value decomposition, and in the solution of linear least squares problems.
Traveling Salesman Problems with Profits
Authors: Dominique Feillet, Pierre Dejax, Michel Gendreau
Venue: Transportation Science (2005)

Traveling salesman problems with profits (TSPs with profits) are a generalization of the traveling salesman problem (TSP), where it is not necessary to visit all vertices. A profit is associated with each vertex. The overall goal is the simultaneous optimization of the collected profit and the travel costs. These two optimization criteria appear either in the objective function or as a constraint. In this paper, a classification of TSPs with profits is proposed, and the existing literature is surveyed. Different classes of applications, modeling approaches, and exact or heuristic solution techniques are identified and compared. Conclusions emphasize the interest of this class of problems, with respect to applications as well as theoretical results.
Individual-based modelling of bacterial ecologies and evolution: Conference Reviews
Authors: C. Vlachos, R. Gregory, R. C. Paton, J. R. Saunders, Q. H. Wu
Venue: Comparative and Functional Genomics (2004)

This paper presents two approaches to the individual-based modelling of bacterial ecologies and evolution using computational tools. The first approach is a fine-grained model that is based on networks of interactivity between computational objects representing genes and proteins. The second approach is a coarser-grained, agent-based model, which is designed to explore the evolvability of adaptive behavioural strategies in artificial bacteria represented by learning classifier systems. The structure and implementation of these computational models is discussed, and some results from simulation experiments are presented. Finally, the potential applications of the proposed models to the solution of real-world computational problems, and their use in improving our understanding of the mechanisms of evolution, are briefly outlined. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A monadic analysis of information flow security with mutable state
Authors: Karl Crary, Aleksey Kliger, Frank Pfenning
Venue: Journal of Functional Programming (2005)

We explore the logical underpinnings of higher-order, security-typed languages with mutable state. Our analysis is based on a logic of information flow derived from lax logic and the monadic metalanguage. Thus, our logic deals with mutation explicitly, with impurity reflected in the types, in contrast to most higher-order security-typed languages, which deal with mutation implicitly via side-effects. More importantly, we also take a store-oriented view of security, wherein security levels are associated with elements of the mutable store. This view matches closely with the operational semantics of low-level imperative languages where information flow is expressed by operations on the store. An interesting feature of our analysis lies in its treatment of upcalls (low-security computations that include high-security ones), employing an &ldquo;informativeness&rdquo; judgment indicating under what circumstances a type carries useful information.
Meta-analysis combines Affymetrix microarray results across laboratories: Conference Papers
Authors: John R. Stevens, R. W. Doerge
Venue: Comparative and Functional Genomics (2005)

With microarray technology becoming more prevalent in recent years, it is now common for several laboratories to employ the same microarray technology to identify differentially expressed genes that are related to the same phenomenon in the same species. Although experimental specifics may be similar, each laboratory will typically produce a slightly different list of statistically significant genes, which calls into question the validity of each gene list (i.e. which list is best). A statistically-based meta-analytic approach to microarray analysis systematically combines results from the different laboratories to provide a single estimate of the degree of differential expression for each gene. This approach provides a more precise view of genes that are of significant interest, while simultaneously allowing for differences between laboratories. The widely-used Affymetrix oligonucleotide array and its software are of particular interest because the results are naturally suited to a meta-analysis. A simulation model based on the Affymetrix platform is developed to examine the adaptive nature of the meta-analytic approach and to illustrate the utility of such an approach in combining microarray results across laboratories. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Achieving proportional delay differentiation in wireless LAN via cross-layer scheduling: Research Articles
Authors: Yuan Xue, Kai Chen, Klara Nahrstedt
Venue: Wireless Communications Mobile Computing (2004)

Providing service differentiation in wireless networks has attracted much attention in recent research. Existing studies so far have focused on the design of differentiated media access algorithms. Some quality of service (QoS) metrics, such as queueing delay cannot be completely addressed by these approaches. Moreover, without a formalized service differentiation goal that quantifies the outcome of differentiation, the performance of most of the approaches fluctuates, especially in short time-scales.This paper addresses above problems by introducing the concept of proportional service differentiation, to the domain of wireless network and focuses on providing proportional delay differentiation in wireless LANs. Due to the unique characteristic of distributed medium sharing, the scheduling algorithm employed in wireline networks can not be applied directly to the context of wireless LANs. We argue that delay differentiation in wireless LAN can only be achieved through a joint packet scheduling at the network layer and distributed coordination at the media access control (MAC) layer. Therefore, we present a cross-layer waiting time priority (CWTP) scheduling algorithm. CWTP consists of two tiers: an intra-node waiting time priority (WTP) scheduler at the network layer and an inter-node distributed coordination function at the MAC layer. These two tiers coordinate via a mapping function, which maps the normalized waiting time at the network layer to the backoff time at the MAC layer. Two mapping schemes, namely linear mapping and piecewise linear mapping, are presented and evaluated in this paper. Extensive simulation results show that the CWTP algorithm can effectively achieve proportional delay differentiation in wireless LANs. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A Novel Dual-Modulus 2.8 GHz Divide-by-127/128 Prescaler Using Pull Down Transistor in 0.35 μ m CMOS Technology
Authors: Ram Singh Rana
Venue: Analog Integrated Circuits and Signal Processing (2005)

Design of high divide-by-value dual-modulus prescaler remains a challenge in CMOS realization for high speed operation. Prior arts for dual modulus prescaler either divide by a low divide-by-value or cannot operate at high speed. The proposed topology is suitable for high divide-by-value operation at high speed.
Public key cryptography
Authors: Dale Bachman
Venue: Journal of Computing Sciences in Colleges (2004)

This one-hour presentation provides a mathematical overview of current public key encryption algorithms. The motivation for using public key systems to augment symmetric systems is outlined, then two popular systems are described in detail, with special attention to the mathematical problems on which their security is based and the practical level of difficulty of solving these problems. A hands-on demonstration of one algorithm suitable for presentation to a general audience is provided. The talk closes with a survey of the uses to which public key systems are currently being put. 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
Towards a framework for understanding the effectiveness of digital content exploitation strategies
Authors: Ernst-Jan Goedvolk, Edward Faber, René W. Wagenaar
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Due to initiatives like Napster and Kazaa the business case for delivering protected digital content remains problematic. Still little is known about the effectiveness of content exploitation strategies. In this paper the literature on content protection, provisioning and usage is reviewed. Based on this review a causal framework is developed, which seeks to explain the effectiveness of content exploitation strategies. The paper ends with formulating a research agenda for studying content exploitation.
The diffusion space of data diffusion architectures
Authors: Jorge Buenabad-Chávez, Henk L. Muller, Paul W. A. Stallard, David H. D. Warren
Venue: Parallel Computing (2004)

Data diffusion architectures (also known as cache only memory architectures) provide a shared address space using physically distributed main memory that is associative. The associative nature of main memory decouples each address and its data item from any physical location, allowing data items to diffuse, or migrate and replicate, in any node of main memory according to use. Hence remote accesses tend to become local accesses, making the distributed organisation of main memory transparent to software.However, for data to diffuse effectively with reasonable performance, a fraction of main memory must be reserved as diffusion space, to allow for data replication and freedom of data migration. At any moment the amount of distinct data resident in main memory must be less than the capacity of main memory. Otherwise data will keep moving around the interconnect medium and memory nodes, possibly continually displacing data in frequent use by the processors, resulting in poor performance.We present an analysis of the issues in the provision of diffusion space using empirical data from a realistic environment. Our experimental platform is a multiprocessor emulation of a data diffusion architecture that includes the virtual memory component of the Mach operating system. For flexibility in the provision of diffusion space in the context of set-associative memory, our results suggest the need for a simple interaction between virtual memory software and the data diffusing hardware.
Temporal Rank Functions for Forward Secrecy
Authors: Rob Delicata, Steve Schneider
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

A number of key establishment protocols claim the property of forward secrecy, where the compromise of a long-term key does not result in the compromise of previously computed session-keys.We describe how such protocols can be modelled using the process algebra CSP and explain why the well-known rank function approach is incapable of proving their correctness. This shortcoming motivates us to propose a generalised proof technique based on the novel concept of a temporal rank function.We apply this approach to two examples: a protocol due to Boyd and the Cliques (AGDH. 2) group key agreement protocol.
Shape from Shading: A Well-Posed Problem?
Authors: E. Prados, O. Faugeras
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Shape From Shading is known to be an ill-posed problem. We show in this paper that if we model the problem in a different way than it is usually done, more precisely by taking into account the 1/r2 attenuation term of the illumination, Shape From Shading becomes completely well-posed. Thus the shading allows to recover (almost) any surface from only one image (of this surface) without any additional data (in particular, without the knowledge of the heights of the solution at the local intensity "minima", contrary to [6, 23, 8, 25, 12]) and without regularity assumptions (contrary to [17, 10], for example). More precisely, we formulate the problem as that of solving a new Partial Differential Equation (PDE), we develop a complete mathematical study of this equation and we design a new provably convergent numerical method. Finally, we present results of our new Shape From Shading method on various synthetic and real images.
GelForce: a vision-based traction field computer interface
Authors: Kevin Vlack, Terukazu Mizota, Naoki Kawakami, Kazuto Kamiyama, Hiroyuki Kajimoto, Susumu Tachi
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We propose a tactile sensor based on computer vision that measures a dense traction field, or a distribution of 3D force vectors over a 2D surface, which humans also effectively sense through a dense array of mechanoreceptors in the skin. The proposed "GelForce" tactile sensor has an elegant and organic design and can compute large and structurally rich traction fields in real time. We present how this sensor can serve as a powerful and intuitive computer interface for both existing and emerging desktop applications.
An energy-conserved on-demand data broadcasting system
Authors: Jiun-Long Huang, Wen-Chih Peng
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

We propose in this paper an energy-conserved on-demand data broadcasting system by employing the data indexing technique. We also propose algorithm AIDOA to adjust the degree of buckets according to system workload. Experimental results show that algorithm AIDOA is able to greatly reduce power consumption at the cost of slight increment in average access time and adjust the index and data organization dynamically to adapt to change of system workload.
Middleware design issues for ubiquitous computing
Authors: Tatsuo Nakajima, Kaori Fujinami, Eiji Tokunaga, Hiroo Ishikawa
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

Our daily lives will be dramatically changed by embedded small computers in our environments. The environments are called ubiquitous computing environments. To realize the environments, it is important to reduce the cost to develop ubiquitous computing applications by encapsulating complex issues in middleware infrastructures that are shared by various applications.In this paper, we describe three middleware infrastructures for supporting ubiquitous computing, that have developed in our projects. Our infrastructures have tried to hide some complexities to make it easy to develop ubiquitous computing applications in an easy way. We also show some lessons learned in our projects.
Improving the Scalability of Parallel Jobs by adding Parallel Awareness to the Operating System
Authors: Terry Jones, Shawn Dawson, Rob Neely, William Tuel, Larry Brenner, Jeffrey Fier, Robert Blackmore, Patrick Caffrey, Brian Maskell, Paul Tomlinson, Mark Roberts
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

A parallel application benefits from scheduling policies that include a global perspective of the application's process working set. As the interactions among cooperating processes increase, mechanisms to ameliorate waiting within one or more of the processes become more important. In particular, collective operations such as barriers and reductions are extremely sensitive to even usually harmless events such as context switches among members of the process working set. For the last 18 months, we have been researching the impact of random short-lived interruptions such as timer-decrement processing and periodic daemon activity, and developing strategies to minimize their impact on large processor-count SPMD bulk-synchronous programming styles. We present a novel co-scheduling scheme for improving performance of fine-grain collective activities such as barriers and reductions, describe an implementation consisting of operating system kernel modifications and run-time system, and present a set of empirical results comparing the technique with traditional operating system scheduling. Our results indicate a speedup of over 300% on synchronizing collectives.
A configurable cryptography subsystem in a middleware framework for embedded systems
Authors: A. David McKinnon, David E. Bakken, John C. Shovic
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2004)

Computer and network security is becoming increasingly important as both large systems and, increasingly small, embedded systems are networked. Middleware frameworks aid the system developer who must interconnect individual systems into larger interconnected, distributed systems. However, there exist very few middleware frameworks that have been designed for use with embedded systems, which constitute the vast majority of CPUs produced each year, and none offer the range of security mechanisms required by the wide range of embedded system applications. This paper describes MicroQoSCORBA, a highly configurable middleware framework for embedded systems, and its security sub-system. It first presents an analysis of security requirements for embedded applications and what can and should be done in middleware. It then presents the design of MicroQoSCORBA's security subsystem and the wide range of mechanisms it supports. Experimental results for these mechanisms are presented for two different embedded systems and one desktop computer that collectively represent a wide range of computational capabilities.
Listening in: practices surrounding iTunes music sharing
Authors: Amy Voida, Rebecca E. Grinter, Nicolas Ducheneaut, W. Keith Edwards, Mark W. Newman
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

This paper presents a descriptive account of the social practices surrounding the iTunes music sharing of 13 participants in one organizational setting. Specifically, we characterize adoption, critical mass, and privacy; impression management and access control; the musical impressions of others that are created as a result of music sharing; the ways in which participants attempted to make sense of the dynamic system; and implications of the overlaid technical, musical, and corporate topologies. We interleave design implications throughout our results and relate those results to broader themes in a music sharing design space.
Book review: Using Drawperfect by Stuart Bloom (Lloyd Short, 1991)
Venue: ACM SIGSMALL/PC Notes (1991)

Using Drawperfect is a well written book that covers the basics of Drawperfect to more advanced topics, making it a good book to grow with. The first several chapters cover simple commands and familiarize the reader with the different tools Drawperfect has to offer as well as explain what hardware is required and how to install the software. For an experienced Wordperfect user, many of Drawperfect's pull-down menus and set-up options will seem familiar, but this book does a good job of explaining how to get around in Drawperfect without going overboard. There are several illustrations of various menu screens and drawings that make it easy to follow along with the instructions without getting lost or confused. The author also precedes each chapter with a brief summary of the material covered which is useful because it saves on time hunting for information about a particular command. 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
Continuous testing in eclipse
Authors: David Saff, Michael D. Ernst
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Continuous testing uses excess cycles on a developer's workstation to continuously run regression tests in the background, providing rapid feedback about test failures as code is edited. It reduces the time and energy required to keep code well-tested, and it prevents regression errors from persisting uncaught for long periods of time.
Automatic recognition of non-stiffness
Authors: L. F. Shampine, L. S. Baca
Venue: ACM SIGNUM Newsletter (1982)

An outstanding characteristic of mathematical software is assistance provided by the code in recognizing that it is unsuitable for the task posed. A critical decision in the present generation of codes for the numerical solution of the initial value problem for a system of ordinary differential equations (ODEs),(1) y' = f(x, y), a < x < b, y(a) given,is whether the problem is stiff. There are effective programs for the solution of both stiff and non-stiff problems which are, however, grossly inefficient when applied to the wrong type. Unfortunately the user does not have available the information necessary for an accurate decision.
Server-allocation policy for improving response to web-access peaks
Authors: Yutaka Yoshimura, Toshiaki Tarui, Toru Shonai, Shun Kawabe, Mamoru Sugie
Venue: Systems and Computers in Japan (2004)

A prototype VPDC (Virtual Private Data Center)&mdash;a data-center system for automated server-allocation control aimed at response time improvement during access peaks&mdash;was developed. The causes of degradation in web-system performance were determined by measurements on this prototype. It was shown that the CPU-utilization ratio dominates the response time in the case of dynamic-content sites, while the data-transfer rate through networks dominates it in the case of static content sites. Behavior analysis of the prototype showed that the web-response time during access peaks can be improved by an automated server-allocation control algorithm with a CPU utilization of 50&percnt; and a network data-transfer rate of 30 Mbps as thresholds. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(5): 55&ndash;66, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10444
Metacomputing through the Enactment of a BPEL4WS Workflow in a Grid Environment
Authors: Michele Di Santo, Nadia Ranaldo, Eugenio Zimeo
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

The paper presents a Web Services-based platform for the definition and execution of Grid applications described through a workflow language, fulfilling QoS requirements, and implemented by basic and Internet-accessible services delivered by service providers. A first implementation of the platform employs a computation service developed on HiMM, a QoS-based, hierarchical middleware for Grid computing, extended to support the integration of domain specific Web Services invocations in the code of Grid applications. The platform was tested for the prediction of the effects of possible contingencies that compromise the operation of large electrical networks.