ppxscal/embedding_network huggingface dataset:
3D Reconstruction of Cerebral Blood Vessels
Authors: Christian Barillot, Bemard Gibaud, Jean-marie Scarabin, Jean-louis Coatrieux
Venue: IEEE Computer Graphics and Applications (1985)

A new technique that uses photogrammetry and computer graphics for the 3D display of cerebral blood vessels provides anatomic images for diagnosis and treatment planning.
Implementing the new Ada 2005 real-time features on a bare board kernel
Authors: Santiago Urueña, José Pulido, José Redondo, Juan Zamorano
Venue: Proceedings of the 13th international workshop on Real-time Ada (2007)

A real-time kernel providing timing services is a key component of any real-time system. The current revision of the Ada standard provides a range of real-time mechanisms that can be used to ensure the required temporal behaviour of real-time tasks. However, kernel timing services must be implemented carefully in order to avoid overheads and inaccuracies. This paper describes the implementation of the Ada timing services in an evolved version of the Open Ravenscar Kernel. The interrelation among the different timing mechanisms is also analysed and evaluated.
A solution to the Angel Problem
Authors: Oddvar Kloster
Venue: Theoretical Computer Science (2007)

We solve the Angel Problem, by describing a strategy that guarantees the win of an Angel of power 2 or greater. Basically, the Angel should move north as quickly as possible. However, he should detour around eaten squares, as long as the extra distance does not exceed twice the number of eaten squares evaded. We show that an Angel following this strategy will always spot a trap early enough to avoid it.
A Structural Object Programming Model, Architecture, Chip and Tools for Reconfigurable Computing
Authors: Michael Butts, Anthony Mark Jones, Paul Wasson
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

A new platform for reconfigurable computing has an object-based programming model, with architecture, silicon and tools designed to faithfully realize this model. The platform is aimed at application developers using software languages and methodologies. Its objectives are massive performance, long-term scalability, and easy development. In our structural object programming model, objects are strictly encapsulated software programs running concurrently on an asynchronous array of processors and memories. They exchange data and control through a structure of self-synchronizing asynchronous channels. Objects are combined hierarchically to create new objects, connected through the common channel interface. The first chip is a 130nm ASIC with 360 32-bit processors, 360 1KB RAM banks with access engines, and a configurable word-wide channel interconnect. Applications written in Java and block diagrams compile in one minute. Sub-millisecond runtime reconfiguration is inherent.
Software Systems for Computer Graphics
Authors: A. P. Lucido
Venue: Computer (1976)

This paper describes some software packages and programming systems for computer graphics applications, in the process considering software features for both passive and interactive graphics. It examines the structure both of subroutine libraries for use with some base language and of complete programming languages, and outlines the advantages and disadvantages of each, along with facilities that should be present in any software package.
An Efficient Algorithm for Determining Hadamard Sequency Vectors
Authors: S. N. Srihari
Venue: IEEE Transactions on Computers (1979)

An efficient algorithm for determining the sequency vector S¯nof a 2n× 2nHadamard matrix is developed. The method requires fewer computation steps than a previously known method.
A GALS Infrastructure for a Massively Parallel Multiprocessor
Authors: Luis A. Plana, Steve B. Furber, Steve Temple, Mukaram Khan, Yebin Shi, Jian Wu, Shufan Yang
Venue: IEEE Design Test (2007)

The Spinnaker (Spiking Neural Network Architecture) system for large-scale neural modeling is based on a scalable processor chip containing multiple ARM cores. Using a globally asynchronous, locally synchronous (GALS) approach allows custom, off-the-shelf IP to be readily integrated without significant timing-closure design effort. The ARM processors are used to simulate neurons, and generated neural events are carried over an on-chip, packet-switched fabric. This self-timed interconnect is also extended off chip to a provide chip-to-chip interconnect that scales to networks of thousands of chips.
An Optimal Instruction-Scheduling Model for a Class of Vector Processors
Authors: S. Arya
Venue: IEEE Transactions on Computers (1985)

An integer programming model that portrays the architectural features of a class of vector and array processors has been developed. This model is used to produce optimal schedules for low-level-instruction codes of such processors. Optimal schedules are produced for both straight codes and instruction loops. Loop scheduling is separately considered because of special consideration that must be given to the effects of the instructions of consecutive loop iterations on each other that are hidden when static instruction scheduling approach is used. Using the model, a number of experiments have been conducted in optimal scheduling of Cray assembly codes.
P2P Trust Model: The Resource Chain Model
Authors: Sinjae Lee, Shaojian Zhu, Yanggon Kim
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

As is well known, computer security has been given more attention; many mechanisms have been developed to increase P2P security like encryption, sandboxing, reputation, and firewall. Among those technologies, reputation mechanism as an active method is especially useful to automatically record, analyze and adjust peers' reputation, trust, histories among the different peers, and this method is suitable for our anonymous and dynamic P2P environment. Therefore, reputation-based trust mechanism is a secure enough reputation system. In this paper, we present a new reputation-based trust management model to prevent the spread of malicious content in the open community using a resource chain model. The main idea of the resource chain model is using a routing table to record the information of nodes' credibility and their recommending nodes' credibility. Therefore, using this model can help us to find the best and safest resource location efficiently and decrease the number of malicious transactions.
GhostDB: hiding data from prying eyes
Authors: Christophe Salperwyck, Nicolas Anciaux, Mehdi Benzine, Luc Bouganim, Philippe Pucheral, Dennis Shasha
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Imagine that you have been entrusted with private data, such as corporate product information, sensitive government information, or symptom and treatment information about hospital patients. You may want to issue queries whose result will combine private and public data, but private data must not be revealed, say, to the prying eyes of some insurance fraudster. GhostDB is an architecture and system to achieve this. You carry private data in a smart USB device (a large Flash persistent store combined with a tamper and snoop-resistant CPU and small RAM). When the key is plugged in, you can issue queries that link private and public data and be sure that the only information revealed to a potential spy is which queries you pose and the public data you access. Queries linking public and private data entail novel distributed processing techniques on extremely unequal devices (standard computer and smart USB device) in which data flows in only one direction: from public to private. This demonstration shows GhostDB's query processing in action.
Performance Modeling of Database Recovery Protocols
Authors: N. Griffyth
Venue: IEEE Transactions on Software Engineering (1985)

The performance modeling described in this paper compares several protocols which ensure that a database can be recovered to a consistent state after a transaction failure or system crash. The contributions of the paper include a collection of simple analytic models, based on Markov processes, for these protocols and some surprising results on the relative performance of the protocols. We consider only two-stage transactions (all reads before writes) and ignore effects of serializing transactions. The most interesting performance result presented is that, for systems obeying the assumptions of this paper, the "pessimistic" policy of holding write locks to commit point is considerably less efficient than the "optimistic" policy which allows reading of uncommitted data, but risks cascading aborts. A multiversion policy introduced in [2] was also studied and found always to be nearly as good as the optimistic policy and sometimes much better.
Wavelet para-bases and sampling numbers in function spaces on domains
Authors: Hans Triebel
Venue: Journal of Complexity (2007)

This paper deals with wavelet frames (para-bases), local polynomial reproducing formulas, and sampling numbers in function spaces on arbitrary and on E-thick domains in Euclidean n-space. In an Appendix we collect some recent instruments for corresponding function spaces on Euclidean n-space.
Ordinal regression based subpixel shift estimation for video super-resolution
Authors: Mithun Das Gupta, Shyamsundar Rajaram, Thomas S. Huang, Nemanja Petrovic
Venue: EURASIP Journal on Advances in Signal Processing (2007)

We present a supervised learning-based approach for subpixel motion estimation which is then used to perform video super-resolution. The novelty of this work is the formulation of the problem of subpixel motion estimation in a ranking framework. The ranking formulation is a variant of classification and regression formulation, in which the ordering present in class labels namely, the shift between patches is explicitly taken into account. Finally, we demonstrate the applicability of our approach on superresolving synthetically generated images with global subpixel shifts and enhancing real video frames by accounting for both local integer and subpixel shifts.
Probing communities: study of a village photo display
Authors: Nick Taylor, Keith Cheverst, Dan Fitton, Nicholas J. P. Race, Mark Rouncefield, Connor Graham
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

In this paper we describe a technology probe aiming to aid understanding of how digital displays can help support communities. Using a simple photo gallery application, deployed in a central social point in a small village and displaying user-generated photos and videos, we have been able to gain an understanding of this setting, field test our device and inspire new ideas directly from members of the community. We explore the process of deploying this display, the response from residents and how the display has taken a place within the community.
An Expert System for Real-Time Control
Authors: M. L. Wright
Venue: IEEE Software (1986)

Microcomputers can host real-time control expert systems. As Hexscon shows, the key is combining the best of conventional and expert-systm controllers.
Developed Acoustic Multi-relaxation Algorithm for Humidity Measurement in Gas Mixtures
Authors: Ming Zhu, Shu Wang, Shutao Wang, Donghai Xia
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper, we focus on the relaxation process of acoustic waves in polyatomic gases, and build up a multi-relaxation algorithmic model of a gas mixture of nitrogen, oxygen and water vapor. The algorithmic is basing on the complicated transfer mechanism of vibrational-translational, vibrational-vibrational degrees of freedom. By computing acoustic velocity and relaxation attenuation, we notice that changes in water vapor concentration have great influence on the relaxation frequency of the mixture, thus proving the feasibility of detecting humidity by means of relaxation method. Finally, we describe a detailed algorithm to measure proportion of water vapor. This novel approach not only determines the concentration of water vapor, but also reflects the proportional fluctuation of the mixture.
The Computation of Poetry
Authors: Charles Day
Venue: Computing in Science and Engineering (2007)

Contributing editor Charles Day looks at computationally derived poetry.
Segmentation of color images via reversible jump MCMC sampling
Authors: Zoltan Kato
Venue: Image and Vision Computing (2008)

Reversible jump Markov chain Monte Carlo (RJMCMC) is a recent method which makes it possible to construct reversible Markov chain samplers that jump between parameter subspaces of different dimensionality. In this paper, we propose a new RJMCMC sampler for multivariate Gaussian mixture identification and we apply it to color image segmentation. For this purpose, we consider a first order Markov random field (MRF) model where the singleton energies derive from a multivariate Gaussian distribution and second order potentials favor similar classes in neighboring pixels. The proposed algorithm finds the most likely number of classes, their associated model parameters and generates a segmentation of the image by classifying the pixels into these classes. The estimation is done according to the Maximum A Posteriori (MAP) criterion. The algorithm has been validated on a database of real images with human segmented ground truth.
Electronic Scanners with Speech Output?A Communication System for the Physically Handicapped And Mentally Retarded
Authors: Donald Hanson, Peggy Power
Venue: IEEE Micro (1985)

This system employs low-cost electronic symbol scanners and a digital voice synthesizer to enable individuals who are both physically handicapped and mentally retarded to communicate more quickly and effectively.
Performance Analysis of Power Allocation with QoS Constraints in BLAST System
Authors: Jie Hu, Xianzhong Xie, Xing Xu
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Adaptive power loading algorithms for variable beam variable rate (VBVR) Bell Laboratories Layered Space-Time (BLAST) system under QoS constraints are proposed. The truncated right unitary matrix as precoder at transmitter and truncated left unitary matrix as decoder at receiver which are obtained by singular value decomposition (SVD) choose variable eigen-subchannels to carry BLAST codes with variable layers. We compare the average spectral efficiency (ASE) of several power allocation algorithms continuous rate (CR) system, one-time power loading (OPL) system, variable beam variable rate system under instantaneous power constraint (VBVR-IPC) and variable beam variable rate system under average power constraint (VBVR-APC). Simulation shows that VBVR-APC and VBVR-IPC perform better than conventional OPL algorithm.
Knowledge Mass and Automation Reasoning System in Type II Topological Logic
Authors: Yalin Zheng, Zheng Qin, Yong Li, Ji Ouyang, Huijuan Xiao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper introduces and investigate the type II knowl- edge mass, type II knowledge universe, type II knowledge base and type II automatic reasoning system bases on the type II topological logic CII T . We also present and inves- tigate the type II completeness and type II perfectness of knowledge base K in type II regular topological logic CII T with regular matching function C in this paper.
Friendly progressive visual secret sharing
Authors: Wen-Pinn Fang
Venue: Pattern Recognition (2008)

This study presents a new method to achieve progressive image sharing. This new method simplifies the management of multi-secret sharing. The proposed method has all the advantages of traditional visual sharing combined with visual cryptography, namely fast decoding, lossless and prevention of secret disclosure without collecting enough shares. Additionally, it can easily distinguish the group to which the share belongs through friendly meaningful shares.
Load Balancing in Distributed Systems
Authors: T. C. K. Chou
Venue: IEEE Transactions on Software Engineering (1982)

In a distributed computing system made up of different types of processors each processor in the system may have different performance and reliability characteristics. In order to take advantage of this diversity of processing power, a modular distributed program should have its modules assigned in such a way that the applicable system performance index, such as execution time or cost, is optimized. This paper describes an algorithm for making an optimal module to processor assignment for a given performance criteria. We first propose a computational model to characterize distributed programs, consisting of tasks and an operational precedence relationship. This model alows us to describe probabilistic branching as well as concurrent execution in a distributed program. The computational model along with a set of seven program descriptors completely specifies a model for dynamic execution of a program on a distributed system. The optimal task to processor assignment is found by an algorithm based on results in Markov decision theory. The algorithm given in this paper is completely general and applicable to N-processor systems.
A 20 Gbps Scalable Load Balanced Birkhoff-von Neumann Symmetric TDM Switch IC with SERDES Interfaces
Authors: Yu-Hao Hsu, Min-Sheng Kao, Hou-Cheng Tzeng, Ching-Te Chiu, Jen-Ming Wu, Shuo-Hung Hsu
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

For the first time, we implemented a reconfigurable load-balanced TDM switch IC with SERDES interface circuits for high speed networking applications. An N times N TDM switch could be constructed recursively from the TDM switch IC to achieve switching capacity of hundred gigabits per second or higher. The TDM switch IC contained a digital 8 times 8 TDM switch core with 8B10B CODECs and analog SERDES I/O interfaces. In the I/O interfaces, eight 2.56/3.2Gbps dual-mode 16/20:1 SERDES with CML buffers were developed. The 16/20:1 instead of 8/10:1 serializer and deserializer were used to reduce the required operating frequency in the switch core by half. New half-rate architectures and all static CMOS gates were used in the 16/20:1 serializer and deserializer for the low power consumption. A wide-band CML I/O buffer with our patented PMOS active load scheme was developed. All implementation were based on the 0.18 mum CMOS technology. Our implementation showed a 20 Gbps switching capacity for the 8 times 8 TDM switch IC.
Verification-centric realization of electronic vote counting
Authors: Joseph R. Kiniry, Dermot Cochran, Patrick E. Tierney
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

Activist computer scientists, including some of the authors of this paper, have been working against the adoption by governments of commercial, proprietary, insecure, poorly designed and implemented voting systems the world-over. And, while we mainly work to accomplish our goals by educating citizens and communicating with the press, we also must propose solutions to the problems of trustworthy e-voting. If a computer-based voting system is to ever be adopted, that system must be demonstrably of extremely high quality. This paper discusses a methodology and a set of tools we have used to implement a vote counting plugin, for an experimental computer-based voting system using applied formal methods.
Application of Time-Optimal Strategy and Fuzzy Logic to the Engine Speed Control during the Gear-Shifting Process of AMT
Authors: Xiaofeng Yin, Dianlun Xue, Yun Cai
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Engine speed control is a crucial issue in the gear- shifting process of Automated Manual Transmission (AMT). In this paper, we proposed a combined strategy to control the engine speed in such process, which overcomes the shortcomings of time-optimal control and fuzzy control while maintains the advantages of both through a mode switching mechanism in a combined controller. When the deviation between the control target and the actual control output is relatively large, the controller switches to time-optimal control mode; while the deviation is small, the controller switches to fuzzy control mode. The proposed strategy has been applied to engine speed control in the automatic gear-shifting process of an AMT test vehicle, which is testified to be efficient to reduce fuel consumption, engine noise, shift jerk, and clutch friction work by means of decreasing engine speed undulation and shortening gear-shifting time.
Improved Real-Time Shadow Mapping for CAD Models
Authors: Vitor Barata R. B. Barroso, Waldemar Celes
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

Shadow mapping is a widely used rendering technique for real-time shadow generation. However, it may produce jagged shadow borders and incorrect self-shadowing artifacts. When applied to CAD (Computer- Aided Design) models, it presents additional challenges due to the existence of thin and complex-silhouette objects, high depth range, and high depth complexity. In this work, we present a short survey of shadow mapping algorithms and investigate their suitability to CAD model rendering. We also present two improvements to existing techniques: a generalized parameter for LiSPSMs (Light-Space Perspective Shadow Maps) and an adaptive z-partitioning scheme.
Performance Comparison of Camera Interface Methods in a Mobile Handset
Authors: Minyoung Eom, Yeoung-Kyu Lim, Tae Ik Kang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

As we enter the 3G world, the new mobile handsets are challenged to show more and more functions. In order to process high-resolution image, the high-speed data transfer technology that was originally used in communication system or server system started to be adopted in mobile handsets. In this paper, we describe and compare some technologies for high-speed data transfer between camera and ISP focusing on the specifications in the physical layer. Most of these technologies are based on the serial interface and they show excellence in terms of power, bandwidth and EMI in comparison to the conventional parallel interface based on the LVCMOS technology. To verify this fact, this paper presents comparison of the SMIA interfaced camera module and the traditional parallel interfaced camera module.
Knowledge construction from time series data using a collaborative exploration system
Authors: Thomas Guyet, Catherine Garbay, Michel Dojat
Venue: Journal of Biomedical Informatics (2007)

This paper deals with the exploration of biomedical multivariate time series to construct typical parameter evolution or scenarios. This task is known to be difficult: the temporal and multivariate nature of the data at hand and the context-sensitive aspect of data interpretation hamper the formulation of a priori knowledge about the kind of patterns that can be detected as well as their interrelations. This paper proposes a new way to tackle this problem based on a human-computer collaborative approach involving specific annotations. Three grounding principles, namely autonomy, adaptability and emergence, support the co-construction of successive abstraction levels for data interpretation. An agent-based design is proposed to support these principles. Preliminary results in a clinical context are presented to support our proposal. A comparison with two well-known time series exploration tools is furthermore performed.