ppxscal/embedding_network huggingface dataset:
Statistical Neural Networks Based Blind Deconvolution of Spectroscopic Data
Authors: Jinghe Yuan, Shengjiang Chang, Yanxin Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

The resolution of the spectroscopic data can be improved by mathematically removing the degraded effect of the instrument response function. Based on the Shalvi- Weinstein criterion, a statistical neural networks based blind deconvolution algorithm for spectroscopic data is proposed. The true spectra and the spectral slit functions of measure instruments can be estimated simultaneously. Especially, the pre-whitening processing can result in a robust convergence, and the noise can be reduced considerably meanwhile.
Aspects of the Upper Bounds of Finite Input-Memory and Finite Output-Memory Sequential Machines
Authors: M. Freeman
Venue: IEEE Transactions on Computers (1979)

In this paper upper bounds on the finite input-memory µiand finite output-memory µoof n-state completely specified sequential machines (CSSM's) and incompletely specified sequential machines (ISSM's) are investigated. It is observed through computational means that N = n(n - 1)/2 is not a tight upper bound for finite input-memory of ISSM's and finite output-memory of both CSS
Integrating Power Management into Distributed Real-time Systems at Very Low Implementation Cost
Authors: B. Gorjiara
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The development cost of low-power embedded systems can be significantly reduced by reusing legacy designs and applying proper modifications to meet the new power constraints. The proposed power management techniques in the literature for implementing distributed power managers in multi-processor systems are very costly in terms of hardware and software modifications. For example, extra software code for power management must be integrated into each component of the system. Furthermore, in order to turn on a component at a specific time/event, extra hardware timers and interrupt controllers must be added to each component along with proper software/device driver modifications. In this paper, we propose a new centralized power management technique that reduces the power consumption of distributed realtime systems at very low implementation cost. Our power manager does not need software and hardware modifications of each individual component. Instead, it uses the model of the system/application to compute the schedule of turning on/off commands by dynamically simulating the system for a given application scenario. The dynamic simulation can be conservative to reflect the jitter in arrival time of events and/or variation in execution delay of tasks. We applied our power management technique to a distributed software-defined radio system and achieved significant energy savings (60% to 87%) at the cost of 1% energy consumed by the power manager itself, as verified by actual hardware measurements. Furthermore, our power manager reacts to the changes in application scenario (referred to as mission) within milliseconds.
Syntax-Directed Pretty Printing A First Step Towards a Syntax-Directed Editor
Authors: L. F. Rubin
Venue: IEEE Transactions on Software Engineering (1983)

A language-independent syntax-directed pretty printer has been implemented as the first step towards building a language-independent syntax-directed editor. The syntax-directed pretty printer works in two phases: the grammar processing phase and the program processing phase. In the grammar processing stage, a grammar which contains a context-free grammar and information for the parser and pretty printer is processed and all files needed by the second phase are written. With these files, the syntax-directed pretty printer works for the language of the grammar. The syntax-directed editor would use the same grammar processing phase to construct the files needed to make it work for a specific language. In the program processing phase, programs in the language of the grammar are parsed and parse trees are built. If syntax errors are found, error messages are produced and error recovery is done. The parse trees are pretty printed according to the pretty printer specifications given in the grammar, resulting in well-indented, syntactically clear programs.
New Products
Authors: Carl Machover, John Dill
Venue: IEEE Computer Graphics and Applications (1983)

A color-display version of the Hewlett-Packard Series 200, MC68000-based technical computer is now available with a system configuration that includes 640K bytes of RAM, dual 5¼-inch flexible disks, and Basic and Pascal languages.
Rough Set Approximations Based on Random Sets
Authors: Wei-Zhi Wu
Venue: Proceedings of the 2007 IEEE International Conference on Granular Computing (2007)

In this paper, the concept of a random rough set which includes the mechanisms of numeric and non-numeric as- pects of uncertain knowledge is introduced. It is shown that for any belief structure and its inducing belief and plausi- bility measures there exists a random approximation space such that the associated lower and upper probabilities are respectively the given belief and plausibility measures, and vice versa. And for a random approximation space gener- ated from a totally random set, its inducing lower and upper probabilities are respectively necessity and possibility mea- sures.
Dynamic index pruning for effective caching
Authors: Yohannes Tsegay, Andrew Turpin, Justin Zobel
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

RAM and dynamic pruning schemes to reduce query evaluation times. While only a small portion of lists are processed with dynamic pruning, current systems still store the entire inverted list in cache. In this paper we investigate caching only the pieces of the inverted lists that are actually used to answer a query during dynamic pruning. We examine an LRU cache model, and two recently proposed models. We also introduce a new dynamic pruning scheme for impact-ordered inverted lists. Using two large web collections and corresponding query logs we show that, using an LRU cache, our new pruning scheme reduces the number of disk accesses during query processing time by 7%-15% over the state-of-the-art impact-ordered baseline, without reducing answer quality. Surprisingly, however, we discover that using our new pruning scheme makes little difference to disk traffic when the more sophisticated caching schemes are employed.
New Outlook on Processing Radiation Received From Objects Viewed Through Randomly Fluctuating Media
Authors: R. H. T. Bates
Venue: IEEE Transactions on Computers (1975)

A unified approach to interferometry, holography, and the seeing problem is presented. Known interferometric techniques are arranged hierarchically and the concept of the "order" of an interferometer is introduced. When an interferometer is viewing a spatially incoherent object through a randomly fluctuating medium, it is argued that the field of view over which the observed data are isoplanatic depends upon the way in which the data are processed, and the processing methods depend upon the order of the interferometer. By appealing to the principles of Michelson interferometry, intensity interferometry, compound intensity interferometry, off-set holography, and the decomposition of observed radiation into its spatial frequency spectrum, it is found that a convenient characterization can be made of the conditions whereby objects can either be resolved (i.e., the sizes of the objects can be determined) or be imaged faithfully.
Configurable Transactional Memory
Authors: Chirstoforos Kachris, Chidamber Kulkarni
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

Programming efficiency of heterogeneous concurrent systems is limited by the use of lock-based synchronization mechanisms. Transactional memories can greatly improve the programming efficiency of such systems. In field-programmable computing machines, a conventional fixed transactional memory becomes inefficient use of the silicon. We propose configurable transactional memory (CTM) as a mechanism to implement application specific synchronization that utilizes the field-programmability of such devices to match with the requirements of an application. The proposed configurable transactional memory is targeted at embedded applications and is area efficient compared to conventional schemes that are implemented with cache-coherent protocols. In particular, the CTM is designed to be incorporated in to compilation and synthesis paths of either high-level languages or during system creation process using tools such as Xilinx EDK. We study the impact of deploying a CTM in a packet metering and statistics application and two micro-benchmarks as compared to a lock-based synchronization scheme. We have implemented this application in a Xilinx Virtex4 device and found that the CTM was 0-73% better than a fine-grained lock-based scheme.
On decision making support in blood bank information systems
Authors: Bing Nan Li, Ming Chui Dong, Sam Chao
Venue: Expert Systems with Applications: An International Journal (2008)

Information and computer technology popularizes in blood banks for its potentials in working efficiency as well as service quality. But, in the face of the explosive data and information, one of the challenges in blood bank information systems is how to make good use of them for decision making support. In this paper, we desire to explore the mechanisms of decision making support in blood bank information systems. Firstly, the properties of data and decisions in a blood bank are examined carefully; then, we introduce the development of computerized decision making support with special concerns on blood donation and transfusion service; finally, a case study is presented to evidence our understanding on decision making support in blood bank information systems.
A Fast and Accurate Moving Object Extraction Scheme in the MPEG Compressed Domain
Authors: Zhou Qiya, Yang Gaobo, Chen Weiwei, Zhang Zhaoyang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

The hot topic of moving object extraction has been transferred from the pixel domain to directly from the compressed stream. The existed work of compressed-domain moving object extraction in the literature usually can meet the requirement of real-time performance. However, the accuracy of extracted objects is too coarse. The reason is that the information utilized in the compressed-domain extraction process is not abundant and noisy. In order to solve this problem, a novel moving object extraction scheme with high accuracy for MPEG stream is proposed. Firstly, the contour-feature and motion vector based projection are fused to extract the coarse object in an efficient way. Second, the blocks in I frame are partially decoded to improve the segmentation accuracy. The innovation lies in a threshold method of image segmentation with automatic seeding is applied on the DC+2AC image of I frame to extract the contour-feature, which is combined with the projection of motion vector field of P frame to complete the coarse segmentation. Then tradeoff is made between the executive time and results' accuracy. High accuracy is acquired at the cost of partially decoding time and region-growing processing time, which is worthwhile at the expense of such a little more time to refine the result. Experiments reveal that the proposed algorithm has the attributes of both real-time and high accuracy at the same time.
A design flow dedicated to multi-mode architectures for DSP applications
Authors: Cyrille Chavet, Caaliph Andriamisaina, Philippe Coussy, Emmanuel Casseau, Emmanuel Juin, Pascal Urard, Eric Martin
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

This paper addresses the design of multi-mode architectures for digital signal processing applications. We present a dedicated design flow and its associated high-level synthesis tool, named GAUT. Given a unified description of a set of time-wise mutually exclusive tasks and their associated throughput constraints, a single RTL hardware architecture optimized in area is generated. In order to reduce the register, steering logic (multiplexers) and controller (decoding logic) complexities, we propose a joint-scheduling algorithm which maximizes the similarities between control steps and specific binding approaches for both functional units and storage elements which maximize the similarities between the datapaths. We show through a set of test cases that our approach offers significant area saving relative to the state-of-the-art.
Copyrighting Computer Software After Apple v. Franklin
Authors: D. E. Miles
Venue: IEEE Software (1984)

Apple v. Franklin establishes the essential validity of copyrighting software in all of its various forms. The real issue now becomes: Just what does the copyright protect? 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
A normal simulation of coalition logic and an epistemic extension
Authors: Jan Broersen, Andreas Herzig, Nicolas Troquard
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

In this paper we show how coalition logic can be reduced to the fusion of a normal modal STIT logic for agency and a standard normal temporal logic for discrete time, and how this multi-modal system can be suitably extended with an epistemic modality. Both systems are complete, and we provide a new axiomatization for the STIT-fragment. The epistemic extension enables us to express that agents see to something under uncertainty about the present state or uncertainty about which action is being taken. In accordance with established terminology in the planning community, we call this version of STIT the 'conformant STIT'. The conformant STIT enables us to express that agents are able to perform a uniform strategy. As a final word of recommendation for this paper we want to point out that its subject is at the junction of four academic fields, viz. modal logic, philosophy, game-theory and AI-planning.
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
Authors: R. Giancarlo, A. Restivo, M. Sciortino
Venue: Theoretical Computer Science (2007)

We introduce a combinatorial optimization framework that naturally induces a class of optimal word permutations with respect to a suitably defined cost function taking into account various measures of relatedness between words. The Burrows and Wheeler transform (bwt) (cf. [M. Burrows, D. Wheeler, A block sorting lossless data compression algorithm, Technical Report 124, Digital Equipment Corporation, 1994]), and its analog for labelled trees (cf. [P. Ferragina, F. Luccio, G. Manzini, S. Muthukrishnan, Structuring labeled trees for optimal succinctness, and beyond, in: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2005, pp. 198-207]), are special cases in the class. We also show that the class of optimal word permutations defined here is identical to the one identified by Ferragina et al. for compression boosting [P. Ferragina, R. Giancarlo, G. Manzini, M. Sciortino, Boosting textual compression in optimal linear time, Journal of the ACM 52 (2005) 688-713]. Therefore, they are all highly compressible. We also provide, by using techniques from Combinatorics on Words, a fast method to compute bwt without using any end-of-string symbol. We also investigate more general classes of optimal word permutations, where relatedness of symbols may be measured by functions more complex than context length. For this general problem we provide an instance that is MAX-SNP hard, and therefore unlikely to be solved or approximated efficiently. The results presented here indicate that a key feature of the Burrows and Wheeler transform seems to be, besides compressibility, the existence of efficient algorithms for its computation and inversion.
Cooperative Localization with Pre-Knowledge Using Bayesian Network for Wireless Sensor Networks
Authors: Shih-Hsiang Lo, Chun-Hsien Wu, Yeh-Ching Chung
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Obtaining location information by localization schemes for sensor nodes makes applications of wireless sensor networks (WSNs) more meaningful. Most of localization schemes only use the information gathered during the execution of the localization scheme. In this paper, we proposed a location model based on Bayesian Network [18] with proximity measurement, the deployment information, and the deployment knowledge to describe the relations of the locations of sensor nodes deployed in a grid topology with the probabilistic graphical model. Based on the location model, we present a cooperative localization algorithm, the CLPKBN scheme, to do the localization for a WSN. To evaluate the proposed scheme, we implement the CLPKBN scheme and the Probability Grid scheme on a simulator. The experimental results show that the CLPKBN scheme outperforms the Probability Grid scheme in most of test cases.
Errata, November Update
Venue: Computer (1979)

COMPCON Fall Standing Committee Chairman David Hartmann is affiliated with the Library of Congress and not NBS, as the COMPCON Fall 80 announcement stated (p. 95). In the same story, the dates for that conference were incorrectly given as September 2-5; the Conference will be held September 23-25 at the Capital Hilton in Washington, DC. 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
Containment of nested XML queries
Authors: Xin Dong, Alon Y. Halevy, Igor Tatarinov
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Query containment is the most fundamental relationship between a pair of database queries: a query Q is said to be contained in a query Q′ if the answer for Q is always a subset of the answer for Q′, independent of the current state of the database. Query containment is an important problem in a wide variety of data management applications, including verification of integrity constraints, reasoning about contents of data sources in data integration, semantic caching, verification of knowledge bases, determining queries independent of updates, and most recently, in query reformulation for peer data management systems. Query containment has been studied extensively in the relational context and for XPath queries, but not for XML queries with nesting. We consider the theoretical aspects of the problem of query containment for XML queries with nesting. We begin by considering conjunctive XML queries (c-XQueries), and show that containment is in polynomial time if we restrict the fanout (number of sibling sub-blocks) to be 1. We prove that for arbitrary fanout, containment is coNP-hard already for queries with nesting depth 2, even if the query does not include variables in the return clauses. We then show that for queries with fixed nesting depth, containment is coNP-complete. Next, we establish the computational complexity of query containment for several practical extensions of c-XQueries, including queries with union and arithmetic comparisons, and queries where the XPath expressions may include descendant edges and negation. Finally, we describe a few heuristics for speeding up query containment checking in practice by exploiting properties of the queries and the underlying schema.
Workshop Report Microcomputer I/O, Peripherals, and Software
Authors: P. L. Hazan
Venue: Computer (1978)

The IEEE Computer Society's Technical Committee on Minis and Micros presented its first workshop on microcomputer I/O, peripherals, and software October 11 and 12, 1977. Co-sponsored by and held at the Johns Hopkins University Applied Physics Laboratory, the workshop drew approximately 125 members of industry and government. General Chairman was Paul L. Hazan, with Program Chairmen Robert B. McDowell and W. J. Sanda handling the sessions on I/O and peripherals, and software, respectively.
A Case Study on Phase-Locked Loop Automatic Layout Generation and Transient Fault Injection Analysis
Authors: Cristiano Lazzari, Ricardo A. Reis, Lorena Anghel
Venue: Journal of Electronic Testing: Theory and Applications (2007)

This paper reports a case study on the automatic layout generation and transient fault injection analysis of a Phase-Locked Loop (PLL). A script methodology was used to generate the layout based on transistor level specifications. Experiences were performed in the PLL in order to evaluate the sensibility against transient faults. The circuit was generated using the STMicroelectronics HCMOS8D process (0.18 μm). Results reveal the PLL sensitive points allowing the study and development of techniques to protect this circuit against transient faults.
The Effect of Viral Media on Business Usage of P2P
Authors: Danny Hughes, James Walkerdine, Kevin Lee
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

P2P file-sharing poses a number of serious problems for business network administrators including: unpredictable network usage, increased vulnerability to security threats and the danger of legal action. Due to these problems, most businesses attempt to restrict the use of P2P. This paper and the associated demonstration explore the nature of business participation in P2P and particularly highlight the effect of viral media on the participation of large businesses in P2P networks.
IMS-MBMS Convergence for Next Generation Mobile Networks
Authors: A. Ikram, M. Zafar, N. Baker, R. Chiang
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

Mobile and wireless communication standards and technologies have witnessed rapid enhancements in the last few years. Dynamic, interactive, rich content and location based services such as IPTV, multimedia conferencing, buddy lists and presence have emerged. However, multimedia services often prove to be heavy on radio resources and multicast or broadcast is a resource efficient transmission mode. Currently, IMS only supports unicast transmission, so 3GPP MBMS is selected as the broadcast/multicast delivery technology. In this paper, we propose a converged IMS and MBMS architecture, designed to support the next generation of multimedia multicast services. A comprehensive network entity design is also elaborated. This work is carried out as part of EU-IST project C-MOBILE (IST-2005-27423).