ppxscal/embedding_network huggingface dataset:
Minicomputer-based health sciences instruction (summary report)
Authors: Christopher R. Brigham
Venue: ACM SIGCUE Outlook (1974)

Simplicity, ease of access, reliability, and frequent freedom from communication charges and difficulties, make the use of low-cost minicomputers attractive. Although their cost per computation is relatively high, in certain situations minicomputers may cost less than the use of a large time-shared computer and communication lines. Minicomputers are currently handicapped by small memory size and inadequate high speed bulk storage. Therefore, they frequently lack sophisticated languages and operating systems, and are limited in performing extensive computation and handling large amounts of data. As minicomputer technology advances, these problems should be alleviated.
Certificate-less user authentication with consent
Authors: Shingo Orihara, Yukio Tsuruoka, Kenji Takahashi
Venue: Proceedings of the 2007 ACM workshop on Digital identity management (2007)

We introduce a new authentication scheme that is intended to be used on electronic commerce (EC) sites, which do not require strict user authentication but need user identification. That is, the EC sites judge whether a user is the same person who visited the site before. We designed our scheme to be as simple and lightweight as possible, for example, we do not assume the existence of trusted third parties (TTPs), e.g. CAs, which are not necessarily needed to identify users. We noticed that password-based authentication has a property that enables EC sites to confirm that there was an interaction with the user. This can be used to show that the user confirmed some agreement. This confirmation of agreement is sometimes important for EC sites. Our scheme can change how to combine password-based authentication and public-key-based authentication by its authentication policy, such as required security level and necessity of confirmation of agreement.
Special note from the editors
Authors: Andreas Savvides, Richard Martin, Mani Srivastava
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2007)

The following paper ("An Algorithm for Fast, Model-Free Tracking Indoors" by Aiyou Chen, Cristina Harko, Diane Lambert, and Phil Whiting) was reviewed and selected as part of the Special Issue on Localization, guest edited by Prof. Andreas Savvides (Yale University) and Prof. Richard Martin (Rutgers University). Due to reasons beyond our control, this paper could not be included with the other papers in the special issue in January 2007 (Volume 11, No. 1), and we apologize for that. Kindly refer to the January 2007 issue of MC2R for the Guest Editorial and the other papers.
Artificial Behavioral System By Sensor-Motor Mapping Strategy For Multi-Objective Robot Tasks
Authors: Evren Daglarli, Hakan Temeltas
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this study, behavioral system based robot control architecture is built up for a four-wheel driven and four-wheel steered mobile robot. Behavioral system is determined as evolutionary neural-fuzzy inference system for behavior generation and self-learning processes in the general robot control architecture. The kinematics and dynamic model of the mobile robot with non-holonomic constraints is used as present structure which is modeled in previous studies. The posture and speed of the robot and the configurations, speeds and torques of the wheels can be observed from the simulation plant and virtual reality viewer. The behaviors are investigated regarding their gains, fuzzy inference structures, real-time applicability and their coordination.
Issues in Distributed Processing - an Overview of Two Workshops
Authors: R. H. Eckhouse
Venue: Computer (1978)

Two workshops on distributed processing were held at Brown University in 1976 and 1977, sponsored by the Army Research Office, the National Science Foundation, and the Office of Naval Research. The workshops had three goals:
The Vivostat&reg; application system: A comparison with conventional fibrin sealant application systems
Authors: R. A. Dodd, R. Cornwell, N. E. Holm, A. Garbarsch, D. A. Hollingsbee
Venue: Technology and Health Care (2002)

The method of applying fibrin sealants may affect their physical properties and surgical performance. In this study, the characteristics of a novel fibrin-sealant application system (Vivostat&reg;) were compared with conventional fibrin sealant spray systems. Delivery rates of Vivostat were highly reproducible in both high and low delivery modes (coefficient of variation [CV] < 1.0%) Airflow rates of Vivostat were 578 ml/min (6.6% (6.5% were lower and less variable than conventional systems, which ranged from 5,000 to 10,000 ml/min depending on the pressure. Spray forces of Vivostat were conseqently lower than other systems and the deposited fibrin films formed were of more consistent thickness. Unlike other systems, blockages with Vivostat were rare on intermittent use. The Vivostat system offers the surgeon a controlled, precise and efficient means of fibrin sealant application with potential performance advantages over conventional spray application systems.
XML Query Recommendation Based On Association Rules
Authors: Yijun Bei, Gang Chen, Lihua Yu, Feng Shao, Jinxiang Dong
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

With the growing popularity of XML technology, developing effective and efficient query techniques of XML data becomes an important problem. In this paper, we introduce a query recommendation technique, which is able to provide both result recommendation and query input recommendation for XML queries, to help users to find useful information more efficiently. In our approach, we mine association rules from XML documents to discover related XML fragments and recommend to the user the possibly interesting results, which are however not included in the original query results. In order to restrict the number of discovered rules and to discard uninteresting rules, our system allows users to specify constraints on the generated association rules. In addition to the recommendation of results, our system also provides potentially relevant XML queries to help users to find the desired content rapidly. Our experimental results show that our methods can provide recommendations for both query results and query input effectively.
MNav: A Markov Model-Based Web Site Navigability Measure
Authors: Yuming Zhou, Hareton Leung, Pinata Winoto
Venue: IEEE Transactions on Software Engineering (2007)

Website success is significantly associated with navigability, an important attribute of usability that denotes the ease with which users find desired information as they move through a website. Navigable websites allow users to form a mental model of the type and location of information in the website and an expectation of where and to what a particular hyperlink will lead. Existing navigability measures are based mainly on the static hyperlink structure of a website. Such measures, however, have two main drawbacks: 1) the effect on navigability of link structure cannot be well characterized; and 2) the effect on navigability of the navigation aids (such as the "°Back"± button provided by a browser) is ignored. In this paper, we abstract dynamic web surfing behavior as a Markov model and use this as the basis of a novel navigability measure, MNav. An empirical validation shows that MNav provides an effective and useful measurement of website navigability.
Exploiting Power-Area Tradeoffs in Behavioural Synthesis through clock and operations throughput selection
Authors: M. A. Ochoa-Montiel, B. M. Al-Hashimi, P. Kollig
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper describes a new dynamic-power aware High Level Synthesis (HLS) data path approach that considers the close interrelation between clock choice and operations throughput selection whilst attempting to minimize area, power, or a combination thereoL It is shown that the proposed approach with its compound cost function and its novel clock and operations throughput selection algorithm, obtains solutions with lower power and area than using previous relevant work [11]. Moreover, different power-area tradeoffs can be explored due to the appropriate choice of clock period and operations throughput using our novel approach.
An Incremental and FCA-Based Ontology Construction Method for Semantics-Based Component Retrieval
Authors: Xin Peng, Wenyun Zhao
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

In semantics-based component retrieval ontology is usually employed as the semantic basis for component representation and matching. Existing methods always assume that the ontology already exists. However, ontology construction itself is a big challenge and the construction of ontology for component retrieval has its own characteristics differing from general domain ontology, including the emphasis on functional semantics, the explicit instance set (i.e. semantic descriptions of all the components stored in the repository) and the explicit objective of characterizing components for retrieval. In this paper, we propose an incremental and FCA (Formal Concept Analysis) based ontology construction method. The feature of incremental ontology construction means a collaborative and interactive process with component providers to collect basic input/output descriptions of components. FCA with the extension of hierarchical-valued concept context is adopted to elicit concepts from original component descriptions to construct ontological hierarchy for functional concepts. After concept analysis, semantic representation of each component can also be filled automatically. So our method can alleviate the efforts of ontology construction remarkably and the quality can also be ensured in terms of the requirements of component retrieval.
Bidder-anonymous English auction scheme with privacy and public verifiability
Authors: Yu Fang Chung, Kuo Hsuan Huang, Hsiu Hui Lee, Feipei Lai, Tzer Shyong Chen
Venue: Journal of Systems and Software (2008)

This work studies the English auction protocol, which comprises three interactive parties-the Registration Manager, the Auction Manager and the Bidder. The registration manager confirms and authenticates the identities of bidders; the auction manager issues the bidding rights and maintains order in holding the auction. The proposed scheme provides the following security features-anonymity, traceability, no framing, unforgeability, non-repudiation, fairness, public verifiability, non-linkability among various auction rounds, linkability within a single auction round, bidding efficiency, single registration, and easy revocation. The scheme developed herein can effectively reduce the load on the registration and auction managers by requiring the end server to derive the key. It also eliminates the need for bidders to download the auction key and the auction certificate. Hence, the time complexity of processing data is clearly reduced and the best interests of the bidders can be achieved. Accordingly, the scheme is consistent with the actual practice of online transactions.
Listener-based Analysis of Surface Importance for Acoustic Metrics
Authors: Frank Michel Eduard Deines Martin Hering-Bertram Christoph Garth Hans Hagen
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Acoustic quality in room acoustics is measured by well defined quantities, like definition, which can be derived from simulated impulse response filters or measured values. These take into account the intensity and phase shift of multiple reflections due to a wave front emanating from a sound source. Definition (D50) and clarity (C50) for example correspond to the fraction of the energy received in total to the energy received in the first 50 ms at a certain listener position. Unfortunately, the impulse response measured at a single point does not provide any information about the direction of reflections, and about the reflection surfaces which contribute to this measure. For the visualization of room acoustics, however, this information is very useful since it allows to discover regions with high contribution and provides insight into the influence of all reflecting surfaces to the quality measure. We use the phonon tracing method to calculate the contribution of the reflection surfaces to the impulse response for different listener positions. This data is used to compute importance values for the geometry taking a certain acoustic metric into account. To get a visual insight into the directional aspect, we map the importance to the reflecting surfaces of the geometry. This visualization indicates which parts of the surfaces need to be changed to enhance the chosen acoustic quality measure.We apply our method to the acoustic improvement of a lecture hall by means of enhancing the overall speech comprehensibility (clarity) and evaluate the results using glyphs to visualize the clarity ($C_{50}$) values at listener positions throughout the room.
"I know what you did last summer": query logs and user privacy
Authors: Rosie Jones, Ravi Kumar, Bo Pang, Andrew Tomkins
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

We investigate the subtle cues to user identity that may be exploited in attacks on the privacy of users in web search query logs. We study the application of simple classifiers to map a sequence of queries into the gender, age, and location of the user issuing the queries. We then show how these classifiers may be carefully combined at multiple granularities to map a sequence of queries into a set of candidate users that is 300-600 times smaller than random chance would allow. We show that this approach remains accurate even after removing personally identifiable information such as names/numbers or limiting the size of the query log. We also present a new attack in which a real-world acquaintance of a user attempts to identify that user in a large query log, using personal information. We show that combinations of small pieces of information about terms a user would probably search for can be highly effective in identifying the sessions of that user. We conclude that known schemes to release even heavily scrubbed query logs that contain session information have significant privacy risks.
On Providing Guaranteed Detectability for Surveillance Applications
Authors: Yanmin Zhu, Quanbin Chen, Lionel M. Ni
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Surveillance is an important class of applications for wireless senor networks (WSNs), whose central task is to detect events of interest. Existing approaches seriously suffer from blind spots and low energy efficiency. In this paper, we propose a fully distributed algorithm GAP for energy-efficient event detection for surveillance applications. The unique features of GAP are threefold. First, it provides guaranteed detectability for any event occurring in the sensing field. Second, it exposes a convenient interface of the user to specify the desired detectability. Finally, it significantly reduces the duty cycle of each sensor and therefore prolongs system lifetime remarkably. Without relying on costly time synchronization, GAP is a lightweight distributed protocol and is truly scalable to network scale and sensor density. Comprehensive experiments are conducted, which demonstrate the efficacy of the GAP algorithm.
Investigation of Methodologies for the Segmentation of Squamous Epithelium from Cervical Histological Virtual Slides
Authors: Yinhai Wang, Richard Turner, Danny Crookes, Jim Diamond, Peter Hamilton
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

Tis paper investigates image segmentation methods for the automated identification of Squamous epithelium from cervical virtual slides. Such images can be up to 120K×80K pixels in size. Through investigation a multiresolution segmentation strategy was developed to give the best segmentation results in addition to saving processing time and memory. Squamous epithelium is initially segmented at a low resolution of 2X magnification. The boundaries of segmented Squamous epithelium are further fine tuned at the highest resolution of 40X magnification. Robust texture feature vectors were developed in conjunction with a Support Vector Machine (SVM) to do classification. Finally medical histology rules are applied to remove misclassifications. Results show that with selected texture features, SVM achieved more than 92.1% accuracy in testing. In tests with 20 virtual slides, results are promising.
Star-cubing: computing iceberg cubes by top-down and bottom-up integration
Authors: Dong Xin, Jiawei Han, Xiaolei Li, Benjamin W. Wah
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Data cube computation is one of the most essential but expensive operations in data warehousing. Previous studies have developed two major approaches, top-down vs. bottom-up. The former, represented by the Multi-Way Array Cube (called MultiWay) algorithm [25], aggregates simultaneously on multiple dimensions; however, it cannot take advantage of Apriori pruning [2] when computing iceberg cubes (cubes that contain only aggregate cells whose measure value satisfies a threshold, called iceberg condition). The latter, represented by two algorithms: BUC [6] and H-Cubing[11], computes the iceberg cube bottom-up and facilitates Apriori pruning. BUC explores fast sorting and partitioning techniques; whereas H-Cubing explores a data structure, H-Tree, for shared computation. However, none of them fully explores multi-dimensional simultaneous aggregation. In this paper, we present a new method, Star-Cubing, that integrates the strengths of the previous three algorithms and performs aggregations on multiple dimensions simultaneously. It utilizes a star-tree structure, extends the simultaneous aggregation methods, and enables the pruning of the group-by's that do not satisfy the iceberg condition. Our performance study shows that Star-Cubing is highly efficient and outperforms all the previous methods in almost all kinds of data distributions.
Computer Science and Engineering Education Introduction and Overview
Authors: M. C. Mulder
Venue: Computer (1977)

A question often asked of those closely associated with the affairs of the Computer Society is, "What can the society do for me?" Occasionally I have asked the same question. In these introductory comments, I would like to present one way in which our society, using part of the dues we each pay each year along with a great amount of volunteer effort, has been addressing the current and future needs of society members. The effort has to do with education in computer science and engineering; the results are partly evidenced by the ten solicited articles of this special supplement, which present the results of the Computer Society's Model Curriculum Subcommittee Report, A Curriculum in Computer Science and Engineering (EHOI 19-8).
Intelligent mind-mapping
Authors: Vincent Chik, Beryl Plimmer, John Hosking
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Current computer based mind-mapping tools are much slower to use than pen and paper because users are distracted by tool operations such as finding and arranging widgets. The shift in focus from brainstorming to tool management interrupts the rapid brainstorming process that mind maps are intended to support. Our pen based mind-mapping software that includes intelligent ink recognition, editing and export alleviates these intrusions as the user only has to worry about writing on the canvas, yet usual digital document support is provided. The digital ink recognition and manipulation techniques described here will be of interest to others working with informal documents.
Flexible architecture of ultra-low-power current-mode interleaved successive approximation analog-to-digital converter for wireless sensor networks
Authors: Rafał Długosz, K. Iniewski
Venue: VLSI Design (2007)

A novel 8-bit current mode interleaved successive approximation (SAR) analog-digital converter (ADC) has been proposed. The proposed converter architecture is very flexible. Using two control DC voltages and one reference current, the converter can be tuned to work with different sampling rates, number of bits of resolution, and power consumption levels. Due to its very low-power consumption and flexibility, the converter is particularly suitable for application in wireless sensor networks. Compared to other solutions presented in the literature, the proposed converter achieves very high figure of merit (FOM) value due to numerous low-power circuit innovations utilized in its design. The circuit has been implemented in CMOS 0.18 µm technology. Minimum energy consumption has been found to be in a 25-250 kS/s range (for clock sampling frequency in a 200 kHz-2MHz range) for a single SAR section with the corresponding power dissipation varying from 220 nW to 560 nW for 0.55 V power supply.
An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem
Authors: Marcelo C. Couto, Cid C. de Souza, Pedro J. de Rezende
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

In this paper, we propose an exact algorithm to solve the Orthogonal Art Gallery problem in which guards can only be placed on the vertices of the polygon P representing the gallery. Our approach is based on a discretization of P into a finite set of points in its interior. The algorithm repeatedly solves an instance of the Set Cover problem obtaining a minimum set Z of vertices of P that can view all points in the current discretization. Whenever P is completely visible from Z, the algorithm halts; otherwise, the discretization is refined and another iteration takes place. We establish that the algorithm always converges to an optimal solution by presenting a worst case analysis of the number of iterations that could be effected. Even though these could theoretically reach O(n^4), our computational experiments reveal that, in practice, they are linear in n and, for n \leq 200, they actually remain less than three in almost all instances. Furthermore, the low number of points in the initial discretization, O(n^2), compared to the possible O(n^4) atomic visibility polygons, renders much shorter total execution times. Optimal solutions found for different classes of instances of polygons with up to 200 vertices are also described.
Sparse Matrix-Vector Multiplication Design on FPGAs
Authors: Junqing Sun, Gregory Peterson, Olaf Storaasli
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

Creating a high throughput sparse matrix vector multiplication (SpMxV) implementation depends on a balanced system design. In this paper, we introduce the innovative SpMxV Solver designed for FPGAs (SSF). Besides high computational throughput, system performance is optimized by reducing initialization time and overheads, minimizing and overlapping I/O operations, and increasing scalability. SSF accepts any matrix size and can be easily adapted to different data formats. SSF minimizes the control logic by taking advantage of the data flow via an innovative accumulation circuit which uses pipelined floating point adders. Compared to optimized software codes on a Pentium 4 microprocessor, our design achieves up to 20x speedup.