ppxscal/embedding_network huggingface dataset:
A Mammography Database and View System for the African American Patients
Authors: Shani Ross, O'tega Ejofodomi, Ahmed Jendoubi, Mohamed Chouikha, Ben Lo, Paul Wang, Jianchao Zeng
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

In this research, we have obtained and scanned mammography films (within the last ten years) of African American women treated at Howard University Hospital Radiology Department, constructed a database using the digitized mammography images, and developed an image viewing system to display these digital mammograms. The images are scanned with the high resolution Kodak LS85 laser scanner. The digital mammography database is powered by MySQL and PHP. It also has a web-based search engine (with secure access) so that the information can be made accessible to all medical team members. The image viewing software, D-Viewer, is coded in C# and is intended to help medical professionals view and retrieve large data sets in near real time. We have already digitized 260 cases (one case per patient, twenty to forty films per case). We also have developed a MySQL-based image database, and a PHP-based web-search engine to retrieve cases that have masses (benign or malignant) or calcifications (benign or malignant). This database has been evaluated by medical professionals and the experimental results obtained so far are very promising (high image qualities, fast access time). We are currently developing an image content-based retrieval function for the database system in order to provide improved search capability for the medical professionals.
HERMES: an infrastructure for low area overhead packet-switching networks on chip
Authors: Fernando Moraes, Ney Calazans, Aline Mello, Leandro Möller, Luciano Ost
Venue: Integration, the VLSI Journal (2004)

The increasing complexity of integrated circuits drives the research of new on-chip interconnection architectures. A network on chip draws on concepts inherited from distributed systems and computer networks subject areas to interconnect IP cores in a structured and scalable way. The main goal pursued is to achieve superior bandwidth when compared to conventional on-chip bus architectures. This paper reviews the state of the art in networks on chip. Then, it describes an infrastructure called Hermes, targeted to implement packet-switching mesh and related interconnection architectures and topologies. The basic element of Hermes is a switch with five bi-directional ports, connecting to four other switches and to a local IP core. The switch employs an XY routing algorithm, and uses input queuing. The main design objective was to develop a small size switch, enabling its immediate practical use. The paper also presents the design validation of the Hermes switch and of a network on chip based on it. A Hermes NoC case study has been successfully prototyped in hardware as described in the paper, demonstrating the functionality of the approach. Quantitative data for the Hermes infrastructure is advanced.
An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem
Authors: Shoshana Anily, Julien Bramel
Venue: Discrete Applied Mathematics (2004)

We consider the Inventory-Routing Problem where n geographically dispersed retailers must be supplied by a central facility. The retailers experience demand for a product at a deterministic rate and incur holding costs for keeping inventory. Distribution is performed by a fleet of capacitated vehicles. The objective is to minimize the average transportation and inventory costs per unit time over the infinite horizon. In this paper, we focus on the set of fixed partition policies. In a fixed partition policy, the retailers are partitioned into disjoint and collectively exhaustive sets. Each set of retailers is served independently of the others and at its optimal replenishment rate. We derive a deterministic (O(n)) lower bound on the cost of the optimal fixed partition policy. A probabilistic analysis of the performance of this bound demonstrates that it is asymptotically 98.5%-effective. That is, as the number of retailers increases, the lower bound is very close to the cost of the optimal fixed partition policy.
Advanced decision systems' CODEX: MUC-3 test results and analysis
Authors: Laura Blumer Balcom, Richard M. Tong
Venue: Proceedings of the 3rd conference on Message understanding (1991)

ADS has developed a general purpose message data extraction system concept, called CODEX (for COntext directed Data EXtraction), that we instantiated for MUC-3 as shown in Figure 1.
A Study upon SNMP MIB II Algorithm: For the Calculation of the Line Utilization
Authors: Seongjin Ahn, Jin Chung Wook
Venue: The Journal of Supercomputing (2005)

This study proposes an algorithm of the maximum value accumulation method that uses the SNMP MIB II to calculate the line utilization on a network based on TCP/IP protocol. There are four types of algorithms to calculate it; the utilization accumulation method, the utilization midterm calculation method, the maximum calculation method, and the maximum accumulation method. The first two methods are not suitable to detect the faults or process the transmission delays in that they are to be followed by their line utilization, if applicable. On the contrary, the other two whose calculations are based on their accumulated amount of bytes, can be used to not only detect the faults but also compensate for the packet delays. The calculations of the line utilization have their practical uses in the capacity planning, the best calculation algorithm for which the maximum accumulation method would serve as. Its practicability includes coping with system faults, line and routing faults and wraparound of the MIB variables, along with its availability as an indicator for the bandwidth upgrade. The study includes its comparison of the latter two methods above by collecting the current traffic on a TCP/IP network to work on the characteristics of the proposed algorithm, as would help a network manager understand the current status of the line capacity to use series of data as an indicator in the line capacity planning.
Application of artificial intelligence to chess playing
Authors: Jason Cook
Venue: Journal of Computing Sciences in Colleges (2004)

Artificial Intelligence is a branch of Computer Science that can be thought of as teaching a computer to act creatively. One interesting application of Artificial Intelligence is programming a computer to play chess. Chess presents challenges that are not present in other games, because of its complexity and the number of possible moves to evaluate. A common strategy for chess programs is to develop a tree data structure with all of the possible moves from a given starting board up to a certain depth, and then traverse the tree and evaluate it to find a good move. The most advanced current programs work around the potentially astronomical size of this tree by eliminating branches with heuristics, and sometimes by using powerful chess-specific hardware. 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
Quizmaster: a software-based student response system
Authors: G. Jan Wilms
Venue: Journal of Computing Sciences in Colleges (2005)

There are several commercial hardware-based student response systems available, where students use a handheld remote to "vote" on a test or an informal quiz. This can be used for formal assessment of individual performance, or to give the instructor a quick "feel" how well the class as an aggregate understands the material at hand. We have developed a software version of this instrument, which uses a Java applet and a web server to perform the same functionality.
Uniformity, Bipolarization and Pluriformity Captured as Generic Stylized Behavior with an Agent-Based Simulation Model of Attitude Change
Authors: Wander Jager, Frédéric Amblard
Venue: Computational Mathematical Organization Theory (2005)

This paper focuses at the dynamics of attitude change in large groups. A multi-agent computer simulation has been developed as a tool to study hypothesis we take to study these dynamics. A major extension in comparison to earlier models is that Social Judgment Theory is being formalized to incorporate processes of assimilation and contrast in persuasion processes. Results demonstrate that the attitude structure of agents determines the occurrence of assimilation and contrast effects, which in turn cause a group of agents to reach consensus, to bipolarize, or to develop a number of subgroups sharing the same position. Subsequent experiments demonstrate the robustness of these effects for a different formalization of the social network, and the susceptibility for population size.
A Stereo Matching Algorithm Based on Multiresolution and Epipolar Constraint
Authors: Wei Zhang, Quanbing Zhang, Lei Qu, Sui Wei
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Stereo matching is one of the most active research areas in computer vision. In this paper, a fast stereo matching algorithm by means of epipolar constraint and multiresolution approach was presented. The searching scope of corresponding pixels in the original image will be obtained and diminished a lot based on multiresolution approach. Then intensity correlation principle and epipolar constraint can be applied to get the stereo matching results in this scope. In this way, not only can we reduce the search time for correspondence but also ensure the validity of matching. The experimental results show this algorithm is effective and efficient.
A framework for building reality-based interfaces for wireless-grid applications
Authors: Orit Shaer
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The pervasive adoption of wireless technologies is creating a growing demand for seamless interaction with wireless services. By sharing resources across devices such as PDA's, sensors and cameras, Wireless Grids provide the opportunity to allow users seamless access to services via a new generation of user interfaces. These interfaces draw upon users existing skills of interaction with objects in the real physical world thus, we refer to them as reality-based interfaces. Although these interfaces offer the promise of ease of use, they are currently more difficult to build than traditional ones. The aim of this research is to simplify the task of developing reality-based interfaces and adapting them to a changing landscape of resources. This goal will be accomplished by providing developers with a high level user interface description language (UIDL) and a user interface management system (UIMS) which describes and enables to develop these interfaces given the uncertainty of the input-output devices they will employ.
How to Mask the Structure of Codes for a Cryptographic Use
Authors: Thierry P. Berger, Pierre Loidreau
Venue: Designs, Codes and Cryptography (2005)

In this paper we show how to strengthen public-key cryptosystems against known attacks, together with the reduction of the public-key. We use properties of subcodes to mask the structure of the codes used by the conceiver of the system. We propose new parameters for the cryptosystems and even a modified Niederreiter cryptosystem in the case of Gabidulin codes, with a public-key size of less than 4000 bits.
Conditional XPath, the first order complete XPath dialect
Authors: Maarten Marx
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

XPath is the W3C -- standard node addressing language for XML documents. XPath is still under development and its technical aspects are intensively studied. What is missing at present is a clear characterization of the expressive power of XPath, be it either semantical or with reference to some well established existing (logical) formalism. Core XPath (the logical core of XPath 1.0 defined by Gottlob et al.) cannot express queries with conditional paths as exemplified by "do a child step, while test is true at the resulting node." In a first-order complete extension of Core XPath, such queries are expressible, We add conditional axis relations to Core XPath and show that the resulting language, called conditional XPath, is equally expressive as first-order logic when interpreted on ordered trees. Both the result, the extended XPath language, and the proof are closely related to temporal logic. Specifically, while Core XPath may be viewed as a simple temporal logic, conditional XPath extends this with (counterparts of) the since and until operators.
Dynamic algorithms for approximating interdistances
Authors: Sergey Bereg, Michael Segal
Venue: Nordic Journal of Computing (2004)

In this paper we present efficient dynamic algorithms for approximation of kth, 1 ≤ k ≤ (n 2) distance defined by some pair of points from a given set S of n points in d-dimensional space. Our technique is based on the dynamization of well-separated pair decomposition proposed in [11], computing approximate nearest and farthest neighbors [22, 25] and use of persistent search trees [17].
The ISPD2005 placement contest and benchmark suite
Authors: Gi-Joon Nam, Charles J. Alpert, Paul Villarrubia, Bruce Winter, Mehmet Yildiz
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

Without the MCNC and ISPD98 benchmarks, it would arguably not have been possible for the academic community to make consistent advances in physical design over the last decade. While still being used extensively in placement and floorplanning research, those benchmarks can no longer be considered representative of today's (and tomorrow's) physical design challenges. In order to drive physical design research over the next few years, a new benchmark suit is being released in conjunction with the ISPD2005 placement contest. These benchmarks are directly derived from industrial ASIC designs, with circuit sizes ranging from 210 thousand to 2.1 million placeable objects. Unlike the ISPD98 benchmarks, the physical structure of these designs is completely preserved, giving realistic challenging designs for today's placement tools. Hopefully, these benchmarks will help accelerate new physical design research in the placement, floor-planning, and routing.
Reliability-Conscious Process Scheduling under Performance Constraints in FPGA-Based Embedded Systems
Authors: G. Chen, M. Kandemir, S. Tosun, U. Sezer
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

This paper proposes, for the FPGA-based embedded systems, a reliability-aware process scheduling strategy that operates under performance bounds. A unique characteristic of the proposed approach is that it employs multiple implementations (also called versions) of a given process; each version differs from the other implementations (of the same process) from the viewpoint of reliability, performance, power, or area metrics. Our scheme, which can work under a base scheduler or independently, tries to use the most reliable version for each process, restricted only by the performance bound specified. We implemented this scheme and simulated it using a custom simulator.
A DCT-Domain System for Hiding Fractal Compressed Images
Authors: Chin-Chen Chang, Chi-Lung Chiang, Ju-Yuan Hsiao
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In this paper, we shall propose an approach for hiding a secret image in a cover image. In the beginning, the fractal image compression method is used to compress the secret image, and then we encrypt this compressed data by DES. Finally, we embed the encrypted data into the middle-frequency domain of DCT. After embedding the secret image, the goal of steganography can be successfully achieved.
Internet nuggets
Authors: Mark Thorson
Venue: ACM SIGARCH Computer Architecture News (2005)

This column consists of selected traffic from the comp.arch newsgroup, a forum for discussion of computer architecture on the Internet---an international computer network.
An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings
Authors: Hiroshi Nagamochi
Venue: Discrete Computational Geometry (2005)

Given a bipartite graph G = (V,W,E), a two-layered drawing consists of placing nodes in the first node set V on a straight line L1 and placing nodes in the second node set W on a parallel line L2. The one-sided crossing minimization problem asks one to find an ordering of nodes in V to be placed on L1 so that the number of arc crossings is minimized. In this paper we use a 1.4664-approximation algorithm for this problem. This improves the previously best bound 3 due to P. Eades and N. C. Wormald [Edge crossing in drawing bipartite graphs, Algorithmica 11 (1994), 379-403].
NEURAL: A Self-Organizing Routing Algorithm for Ad Hoc Networks
Authors: Vicente E. Mujica V, Dorgham Sisalem, Radu Popescu-Zeletin
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

This paper evaluates a self-organizing routing protocol for Ad Hoc network, called the NEUron Routing ALgorithm (NEURAL). NEURAL has been designed taking into account the learning and self-organizing abilities of the brain. More precisely, it was inspired by the synapses process between neurons, when a signal is propagated. Basically, the most significant characteristic of NEURAL is the uniform distribution of the information around the nodeýs location based on the current changes in its neighborhood. Using a 2-hop acknowledgment mechanism, local information is monitored in order to be used for route selection method, classification procedures and learning algorithms.
Distributed Detection of Node Replication Attacks in Sensor Networks
Authors: Bryan Parno, Adrian Perrig, Virgil Gligor
Venue: Proceedings of the 2005 IEEE Symposium on Security and Privacy (2005)

The low-cost, off-the-shelf hardware components in unshielded sensor-network nodes leave them vulnerable to compromise. With little effort, an adversary may capture nodes, analyze and replicate them, and surreptitiously insert these replicas at strategic locations within the network. Such attacks may have severe consequences; they may allow the adversary to corrupt network data or even disconnect significant parts of the network. Previous node replication detection schemes depend primarily on centralized mechanisms with single points of failure, or on neighborhood voting protocols that fail to detect distributed replications. To address these fundamental limitations, we propose two new algorithms based on emergent properties, i.e., properties that arise only through the collective action of multiple nodes. Randomized Multicast distributes node location information to randomly-selected witnesses, exploiting the birthday paradox to detect replicated nodes, while Line-Selected Multicast uses the topology of the network to detect replication. Both algorithms provide globally-aware, distributed node-replica detection, and Line-Selected Multicast displays particularly strong performance characteristics. We show that emergent algorithms represent a promising new approach to sensor network security; moreover, our results naturally extend to other classes of networks in which nodes can be captured, replicated and re-inserted by an adversary.
How users assess web pages for information seeking
Authors: Anastasios Tombros, Ian Ruthven, Joemon M. Jose
Venue: Journal of the American Society for Information Science and Technology (2005)

In this article, we investigate the criteria used by online searchers when assessing the relevance of Web pages for information-seeking tasks. Twenty-four participants were given three tasks each, and they indicated the features of Web pages that they used when deciding about the usefulness of the pages in relation to the tasks. These tasks were presented within the context of a simulated work-task situation. We investigated the relative utility of features identified by participants (Web page content, structure, and quality) and how the importance of these features is affected by the type of information-seeking task performed and the stage of the search. The results of this study provide a set of criteria used by searchers to decide about the utility of Web pages for different types of tasks. Such criteria can have implications for the design of systems that use or recommend Web pages.
Facilitating treebank annotation using a statistical parser
Authors: Fu-Dong Chiou, David Chiang, Martha Palmer
Venue: Proceedings of the first international conference on Human language technology research (2001)

Corpora of phrase-structure-annotated text, or treebanks, are useful for supervised training of statistical models for natural language processing, as well as for corpus linguistics. Their primary drawback, however, is that they are very time-consuming to produce. To alleviate this problem, the standard approach is to make two passes over the text: first, parse the text automatically, then correct the parser output by hand.
Strike a Pose: Tracking People by Finding Stylized Poses
Authors: Deva Ramanan, D. A. Forsyth, Andrew Zisserman
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We develop an algorithm for finding and kinematically tracking multiple people in long sequences. Our basic assumption is that people tend to take on certain canonical poses, even when performing unusual activities like throwing a baseball or figure skating. We build a person detector that quite accurately detects and localizes limbs of people in lateral walking poses. We use the estimated limbs from a detection to build a discriminative appearance model; we assume the features that discriminate a figure in one frame will discriminate the figure in other frames. We then use the models as limb detectors in a pictorial structure framework, detecting figures in unrestricted poses in both previous and successive frames. We have run our tracker on hundreds of thousands of frames, and present and apply a methodology for evaluating tracking on such a large scale. We test our tracker on real sequences including a feature-length film, an hour of footage from a public park, and various sports sequences. We find that we can quite accurately automatically find and track multiple people interacting with each other while performing fast and unusual motions.
Vasilius: The design of an autonomous ground robotic vehicle
Authors: Jarrod M. Snider, Amy E. Snider, Robert N. Riggins
Venue: Journal of Robotic Systems (2004)

This paper presents the design and provides a partial analysis of the performance of an autonomous ground robotic vehicle called Vasilius. Applications for Vasilius include autonomous navigation on a somewhat marked path with obstacles, leader following, and waypoint navigation. The paper focuses on three aspects of Vasilius: the design, the performance, and a technique for filtering, mapping, and learning. The design of Vasilius embodies a novel idea of modeling an autonomous vehicle after human senses and the human decision-making process. For instance, Vasilius integrates information from seven types of independent sensors, and categorizes them into either short-range reaction sensors and&sol;or long-range planning sensors, analogous to what the human brain does. The paper also analyzes the performance of Vasilius, relating theoretical predictions to actual behavior. Some of these analyses, especially for the filtering, mapping, and learning, are still in progress. Performance measures that have been measured include speed, ramp climbing, turn reaction time, battery life, stop reaction time, object detection, and waypoint accuracy. Finally, the paper discusses Vasilius' use of a new approach to filtering, mapping, and learning to enhance its performance. &copy; 2004 Wiley Periodicals, Inc.