ppxscal/embedding_network huggingface dataset:
A Rapid Algorithm to Find Replacement Services for K-Shortest Path Problem with QoS Constraints
Authors: Jianqiang Hu, Xingzhi Feng, Zhiwei Zhang, Quanyuan Wu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

During the execution of composite service, if one service component in critical path fails, or becomes overloaded not to be accessed, a mechanism is needed to ensure that the whole running process isn't interrupted. The failed service needs be replaced quickly and efficiently by switching to a new path. Recent researches on this problem don't consider the influence of the QoS criteria of service candidates or the connection state of the overlay network, so the algorithms are easily disabled. In this paper, we solve the maximum utility path problem that is motivated by recent interest in kshortest path problem. A new algorithm WSC_KUPB (Web Service Composition k-maximum Utility Path Backup) is described to enumerate the k maximum utility of simple loopless paths in a digraph. We construct utility path tree by using the utility function as the evaluation standard. And we enumerate every edge in cut edge set across two utility path trees; compute the utility value of the new path. Finally the optimal path with the maximum total utility is chosen as a backup path. The test result shows the algorithm performs very well in the efficiency and availability as compared to other relevant algorithms.
A Semicausal Model for Recursive Filtering of Two-Dimensional Images
Authors: A. K. Jain
Venue: IEEE Transactions on Computers (1977)

A two-dimensional discrete stochastic model for representing images is developed. This representation has lower mean square error, compared to a standard autoregressive Markov representation. Application of the model to linear filtering of images degraded by white noise leads to scalar recursive filtering equations requiring only 0(N2log2N) computations for N x N images. The
Guest Editors' Introduction: Social Computing
Authors: Daniel Zeng, Fei-Yue Wang, Kathleen M. Carley
Venue: IEEE Intelligent Systems (2007)

Broadly stated, social computing takes a computational approach to the study and modeling of social interactions and communications. It also encompasses the development of technologies supporting these interactions. In recent years, we've seen social computing impact numerous information and communications technology (ICT) fields. It's attracted significant interest from not only researchers in the computing and social sciences but also software and online game vendors, Web entrepreneurs, political analysts, and digital-government practitioners, among others. This special issue samples the state of the art social-computing research from several perspectives: the overall paradigm of social-computing research; technological support for social-computing applications; cognitive modeling and architecture of agents and agent societies; and social-computing applications in areas such as terrorist network analysis, competitive business strategies, and agent behavior in financial markets. This article is part of a special issue on social computing.
CT-PET Landmark-based Lung Registration Using a Dynamic Breathing Model
Authors: S. Chambon, A. Moreno, A. P. Santhanam, J. P. Rolland, E. Angelini, I. Bloch
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper deals with the problem of non-linear landmark-based registration of CT (at two different instants of the breathing cycle, intermediate expirations) and PET images of thoracic regions. We propose a general method to introduce a breathing model in a registration procedure in order to simulate the instant in the breathing cycle most similar to the PET image and guarantee physiologically plausible deformations. Initial results are very promising and demonstrate the interest of this method to improve the combination of anatomical and functional images for diagnosis and oncology applications.
Value-based notification conditions in large-scale publish/subscribe systems?
Authors: Badrish Chandramouli, Jeff M. Phillips, Jun Yang
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

We address the problem of providing scalable support for subscriptions with personalized value-based notification conditions in wide-area publish/subscribe systems. Notification conditions can be fine-tuned by subscribers, allowing precise and flexible control of when events are delivered to the subscribers. For example, a user may specify that she should be notified if and only if the price of a particular stock moves outside a "radius" around her last notified value. Naive techniques for handling notification conditions are not scalable. It is challenging to share subscription processing and notification dissemination of subscriptions with personalized value-based notification conditions, because two subscriptions may see two completely different sequences of notifications even if they specify the same radius. We develop and experimentally evaluate scalable processing and dissemination techniques for these subscriptions. Our approach uses standard network substrates for notification dissemination, and avoids pushing complex application processing into the network. Compared with other alternatives, our approach generates orders of magnitude lower network traffic, and incurs lower server processing cost.
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
Authors: Philip Brisk, Ajay K. Verma, Paolo Ienne
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is to allocate the minimum number of registers such that no scalar variable is spilled to memory. Previously, an optimal polynomial-time algorithm for this problem has been presented for individual procedures represented in Static Single Assignment (SSA) Form. This result is now extended to complete programs (or sub-programs), as long as: (1) each procedure is represented in SSA Form; and (2) at every procedure call, all live variables are split at the call point. With this representation, it is possible to ensure that the interprocedural interference graph (IIG) is chordal, and can therefore be colored optimally in polynomial time. An optimal coloring of the IIG can be achieved by allocating registers for each procedure individually. Previous work has shown that optimal register allocation in SSA Form does not require an interference graph. Optimal interprocedural register allocation, therefore, is achieved without constructing an interference graph, giving the optimal algorithm a significant runtime advantage over prior sub-optimal heuristics.
The Profession as a Culture Killer
Authors: Neville Holmes
Venue: Computer (2007)

Having a World Wide Web for each writing system would allow much better software than would a Universal Web.
A Survey and Taxonomy of GALS Design Styles
Authors: Paul Teehan, Mark Greenstreet, Guy Lemieux
Venue: IEEE Design Test (2007)

Large digital systems increasingly feature global asynchronous interconnects and multiple clock domains. Thus, they are globally asynchronous, locally synchronous (GALS) designs. The authors identify three emerging GALS design styles, present examples of each, survey related research, and describe practical implementation issues. They also discuss the obstacles hindering widespread adoption of GALS design and conclude that CAD support will soon follow the increasing industry interest in this area.
Multichannel Security Protocols
Authors: Ford Long Wong, Frank Stajano
Venue: IEEE Pervasive Computing (2007)

Many security protocols were designed to run over inherently insecure channels such as ad hoc radio or the packet-switched Internet. However, they can be strengthened with additional transmissions over other lower-capacity channels, commonly found in ubicomp environments, that offer a different mix of security properties. A single protocol might exploit different channels for different messages in its trace. The authors demonstrate this point by presenting and discussing several security protocols for ubicomp pairing and group key agreement. This article is part of a special issue on security and privacy.
The key of Lisp
Authors: Susan Ennis
Venue: ACM SIGPLAN Lisp Pointers (1987)

When asked to do this department, I didn't quite catch the fact that I would be required to produce two columns before I could expect some 'letters to the editor'. I do hope that there are some out there because there isn't much here that I haven't talked about before. 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
Design of a cheat-resistant P2P online gaming system
Authors: Patric Kabus, Alejandro P. Buchmann
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Since the huge success of online games and especially that of so called Massively Multiplayer Online Games (MMOGs), the prevention of cheating has been a primary concern of game providers. This is also the main reason why Peer-to-Peer (P2P) architectures are not widely used in this area, although they could offer significant cost savings. Letting player nodes handle game-relevant logic or data means giving away control and opening up additional possibilities for cheaters. In this paper we present a P2P architecture which provides countermeasures against cheats that are inherent to these systems.
Fingerprint Image Segmentation Using Active Contour Model
Authors: Xiaolong Zheng, Yangsheng Wang, Xuying Zhao
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Fingerprint segmentation is a crucial step for automatic fingerprint recognition. In this paper, we present an algorithm to extract fingerprint foreground using active contour model, a discriminative feature based on Fisher measure first be constructed to indicate foreground and background, however, the feature fails to describe the foreground and background when applied to those too dry fingerprints, an regulative term based on block-wise average gray level and orientation coherence be added to obtain an even distributing feature which more benefit to carry out curve evolvement. The segmenting method is testified on public fingerprint collection, FVC DB3, which contains 800 fingerprints with various image qualities. The experimental results show the effectiveness of the proposed method.
Asynchronous Sequential Machines Designed for Fault Detection
Authors: D. H. Sawin
Venue: IEEE Transactions on Computers (1974)

A design procedure is presented which allows for detection of faults in asynchronous sequential machines in a real time environment. Faults affecting both the output states and the internal operation of the machine are detected. The class of faults initially considered are single stuck-at-1 and stuck-at-0 faults. However, since the detection system presented is static and continuous, the class of faults detected will be greatly extended to include intermittent and a large number of multiple faults.
Tour generation for exploration of 3D virtual environments
Authors: Niklas Elmqvist, M. Eduard Tudoreanu, Philippas Tsigas
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Navigation in complex and large-scale 3D virtual environments has been shown to be a difficult task, imposing a high cognitive load on the user. In this paper, we present a comprehensive method for assisting users in exploring and understanding such 3D worlds. The method consists of two distinct phases: an off-line computation step deriving a grand tour using the world geometry and any semantic target information as input, and an on-line interactive navigation step providing guided exploration and improved spatial perception for the user. The former phase is based on a voxelized version of the geometrical dataset that is used to compute a connectivity graph for use in a TSP-like formulation of the problem. The latter phase takes the output tour from the off-line step as input for guiding 3D navigation through the environment.
Software Fault Tolerance: An Evaluation
Authors: T. Anderson
Venue: IEEE Transactions on Software Engineering (1985)

In order to assess the effectiveness of software fault tolerance techniques for enhancing the reliability of practical systems, a major experimental project has been conducted at the University of Newcastle upon Tyne. Techniques were developed for, and applied to, a realistic implementation of a real-time system (a naval command and control system). Reliability data were collected by operating this system in a simulated tactical environment for a variety of action scenarios. This paper provides an overview of the project and presents the results of three phases of experimentation. An analysis of these results shows that use of the software fault tolerance approach yielded a substantial improvement in the reliability of the command and control system.
Content-aware video adaptation under low-bitrate constraint
Authors: Ming-Ho Hsiao, Yi-Wen Chen, Hua-Tsung Chen, Kuan-Hung Chou, Suh-Yin Lee
Venue: EURASIP Journal on Advances in Signal Processing (2007)

With the development of wireless network and the improvement of mobile device capability, video streaming is more and more widespread in such an environment. Under the condition of limited resource and inherent constraints, appropriate video adaptations have become one of the most important and challenging issues in wireless multimedia applications. In this paper, we propose a novel content-aware video adaptation in order to effectively utilize resource and improve visual perceptual quality. First, the attention model is derived from analyzing the characteristics of brightness, location, motion vector, and energy features in compressed domain to reduce computation complexity. Then, through the integration of attention model, capability of client device and correlational statistic model, attractive regions of video scenes are derived. The information object- (IOB-) weighted rate distortion model is used for adjusting the bit allocation. Finally, the video adaptation scheme dynamically adjusts video bitstream in frame level and object level. Experimental results validate that the proposed scheme achieves better visual quality effectively and efficiently.
Error Performance of Rotated Phase Shift Keying Modulation over Fading Channels
Authors: Serdar Özyurt, Oğuz Kucur, İbrahim Altunbaş
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, the modulation diversity is used to improve the performance of M-PSK modulation over fading channels. Modulation diversity can be achieved by rotating the signal constellation and using component interleaving. We derive symbol error probability expressions for rotated uncoded M-PSK over Ricean fading channels and obtain optimal rotation angles for M-PSK (M = 2, 4, 8). We show that rotated signal constellations with component interleaving improve the performance of M-PSK significantly as compared to the unrotated one over Rayleigh and Ricean fading channels. For example, when the ratio of the direct path power to the multipath signal power, K is 0 and 10, 8 and 1.5 dB gains are obtained, respectively, at a symbol error probability of 10¿3 for 8PSK modulation. We also show that as K gets larger, the gain obtained by the rotation rapidly decreases. We develop a new asymmetric 8PSK signal constellation obtained from two QPSK signal constellations that are optimally rotated by different angles. This asymmetric 8PSK and also the rotated 8PSK signal constellation together with component interleaving are applied to four-state trellis-coded schemes. Simulation results show that these new schemes provide good performance improvements over the original TCM schemes and previous relevant works over Rayleigh and Ricean fading channels.
Interpolation in list decoding of Reed-Solomon codes
Authors: P. V. Trifonov
Venue: Problems of Information Transmission (2007)

We consider the problem of efficient implementation of two-dimensional interpolation in the Guruswami-Sudan list decoding algorithm for Reed-Solomon codes. We show that it can be implemented by computing the product of ideals of interpolation polynomials constructed for subsets of interpolation points. A method for fast multiplication of coprime zero-dimensional ideals is proposed.
Aspects of the Kinematic Simulation of Human Movement
Authors: T. W. Calvert
Venue: IEEE Computer Graphics and Applications (1982)

A kinematic simulation model allows realistic animation of the human body-provided the body is in contact with the ground and input data is accurate.
The MIEL system: Uniform interrogation of structured and weakly-structured imprecise data
Authors: Ollivier Haemmerlé, Patrice Buche, Rallou Thomopoulos
Venue: Journal of Intelligent Information Systems (2007)

We present an information system developed to help assessing the microbiological risk in food. That information system contains experimental results in microbiology, mainly extracted from scientific publications. The increasing amount of the experimental results available and the difficulty to integrate them into a classic relational database schema led us to design a system composed of two distinct subsystems queried through a common interface. The first subsystem is a classic relational database. The second subsystem is a database containing weakly-structured pieces of information expressed in terms of conceptual graphs. The data stored in both bases can be fuzzy ones in order to take into account the specificities of the biological information. The uniform query language used on both relational database and conceptual graph database allows the users to express preferences by using fuzzy sets in their queries. The MIEL system is now operational and used by the microbiologists involved in the Sym'Previus French project.
Cyclicity and well-balanced growth in systems with imperfect competition in labor markets
Authors: E. P. Belan, M. V. Mikhalevich, I. V. Sergienko
Venue: Cybernetics and Systems Analysis (2007)

A dynamic macromodel of an economic system with bilateral monopolistic competition in the labor market is considered. Conditions of arising post-classical business cycles in this model are investigated under the assumption that the impact of labor remuneration on the amount of aggregated demand is restricted. Numerical experiments with the model with varied labor productivity demonstrated the possibility of main-line effects.
A Suggestion for a High-Speed Parallel Binary Divider
Authors: R. Stefanelli
Venue: IEEE Transactions on Computers (1972)

A family of four procedures to compute the inverse 1/X of a given binary number X normalized between 0.5 and 1 is described. The quotient is obtained in redundant binary form, i.e., in a base 2 code in which digits can assume any positive or negative integer value. All methods here described can be implemented by combinatorial networks; the dividers realized in this way are very fast because all carry propagations take place at the same time.
Coordination Practices in Distributed Software Development of Small Enterprises
Authors: Alexander Boden, Bernhard Nett, Volker Wulf
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

Global software development has become an important issue for small and medium enterprises. However, the distinct requirements of SME are still not so well understood. In order to contribute to the discussion we present case studies in two small German software companies that engage in offshoring of software development to Eastern Europe. By applying Strauss' articulation work framework we show to what extent SME rely upon situated coordination practices in order to warrant their agility. These practices are applied during discussions in which the actors reflexively evolve problems and solutions from their distinct perspectives and work practices. Thereby they are closely related to formal and informal communication, which takes place both locally and between the different teams. Our findings further suggest that specialized tools for the support of situated coordination practices in terms of articulation work are not so common in practice.
Closure Partition Method for Minimizing Incomplete Sequential Machines
Authors: Chao-Chih Yang
Venue: IEEE Transactions on Computers (1973)

A new method based on a closure partition over a set of some compatibles is proposed for selecting a minimal machine from mutualy independent closure aggregates by simply checking only the trivial covering condition. The closure aggregates are derived from some closure related classes. The latter classes are derived from the closure classes by replacing aU superseded elements with their greatest superseding ones. The compatibles to be considered are some subsets of maximum compatibles related under the state transition or the set inclusion. Closure dependent classes may contain superseded and redundant compatibles but their corresponding closure aggregates have only unsuperseded and irredundant elements. Both of them are closed. However, some closure related class may not be closed and may contain some redundant elements. The remaining unrelated subsets of maximum compatibles are ignored. Superseded or redundant compatibles when they are so determined are also ignored. Thus possible candidates for irredundant closed covers can be yielded and then partitioned under the closure dependence relation.
Two-stage Binary Image Operator Design: an Approach Based on Interaction Information
Authors: Carlos S. Santos, Nina S. T. Hirata, Roberto Hirata Junior
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

We address the problem of binary image operator design over large windows by breaking it into two phases. Firstly, we design several operators over small sub-windows of the main window. The outputs of these first level operators are then combined into a global operator. We devise a heuristic, motivated by Information Theory, for breaking the main window into sub-windows. Preliminary results show that the proposed scheme improves operator performance over single-level operators.
Consistency of SLAM-EKF Algorithms for Indoor Environments
Authors: Diego Rodriguez-Losada, Fernando Matia, Luis Pedraza, Agustin Jimenez, Ramon Galan
Venue: Journal of Intelligent and Robotic Systems (2007)

The solution to the Simultaneous Localization And Mapping (SLAM) problem using an Extended Kalman Filter (EKF) is probably the most extended in the literature despite the recently reported inconsistency of its estimation. There has been an important lack of successful SLAM-EKF implementations for indoor environments that could build monolithic large maps with features conveying angular information. In this paper we analyze the source and factors of the SLAM-EKF inconsistency in indoor environments (where the landmarks contain angular information) and we review current existing approaches presenting novel solutions to this problem that let us build indoor large monolithic feature based maps.