ppxscal/embedding_network huggingface dataset:
Security Assurance Aggregation for IT Infrastructures
Authors: Nguyen Pham, Michel Riguidel
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

In the development of more extensive information systems, IT security becomes increasingly important. The need for a tool to measure current security assurance level is therefore vital in order to maintain and improve the overall security of deployed systems. In this paper, we discuss several security assurance aspects and the role of aggregation in this context. Then, we introduce a general method to combine security assurance information into system wide values. This method takes into account the fact that the relations in complex systems are non-linear and also the appearance of emergent properties. Furthermore, using patterns to simplify the process of the system security assurance assessment is presented as an enhancement.
Randomized Byzantine Agreement
Authors: K. J. Perry
Venue: IEEE Transactions on Software Engineering (1985)

A randomized model of distributed computation was recently presented by Rabin [ 81. This model admits a solution to the Byzantine Agreement Problem for systems of n asynchronous processes where no more than t are faulty. The algorithm described by Rabin produces agreement in an expected number of rounds which is a small constant independent of n and t. Using the same model, we present an algorithm of similar complexity which is able to tolerate a greater portion of malicious processes. The algorithm is also applicable, with minor changes, to systems of synchronous processes.
A Lloyd-Max-based Non-Uniform Quantization Scheme for Distributed Video Coding
Authors: Fang Sheng, Li Xu-Jian, Zhang Li-Wei
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In traditional video compression standards, the quantizer plays an important role. It is the same for the Distributed Video Coding (DVC), which can be thought to consist of a quantizer followed by a Slepian-Wolf encoder. The quantizer has dominant effect on the quality of the reconstructed video. In this context, this paper proposes quantization scheme for DVC based on a modified Lloyd-Max algorithm. The reconstruction values and partitions of quantizer are designed online for each Wyner-Ziv frame. The training set is extracted from the previous frame and a corresponding correlation model is computed respectively in the encoder and decoder. It is shown that at the cost of a slight higher error rate of the turbo code, the simple nonuniform quantization scheme will lower the quantization error in the reconstruction step, and on the whole improve the rate distortion performance.
An Efficient Page Lock/Release OS Mechanism for Out-of-Core Embedded Applications
Authors: Ameet Patil, Neil Audsley
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Embedded system applications are becoming more complex, requiring increased memory. However, additional physical memory increases system cost and power consumption. Virtual memory techniques such as paging, can make use of low-power auxiliary memory, allowing applications increased memory for execution. Currently paging yields poor performance due to page swapping overheads. This paper presents a combined approach of using application hints along with an efficient page lock/release mechanism in the OS to reduce paging overheads. This makes paging a viable solution to support out-of-core embedded real-time applications. The Co-operative Application Specific Paging (CASP) mechanism presented works in conjunction with most existing page replacement policies, providing explicit support for applications via insertion of paging hints in the application source code. Both automatic and manual methods of inserting hints are described and evaluated. The benchmark results of a CASP implementation in the Linux 2.6.16 kernel have shown significant reduction in the number of page-faults (22.3%) and a considerable improvement in application execution times (12.5%).
Chaos Controlled ZCDPLL for Carrier Recovery in Noisy Channels
Authors: Qassim Nasir
Venue: Wireless Personal Communications: An International Journal (2007)

The objective of this work is to analyze the performance of the chaos controlled first order Zero Crossing Digital Phase Locked Loop (ZCDPLL) in the presence of Additive White Gaussian Noise (AWGN). The nonlinear behaviour of ZCDPLL shows a period doubling to its route to chaos. The amount of ZCDPLL divergency is measured and fed-back in a form of linear stabilization. The introduction of the chaos control widens the lock range of a ZCDPLL and improves the loop's operation in the presence of AWGN.
On Shift-Register Realizations of Sequential Machines and Finite-State Universal Sequential Machines
Authors: D. R. Haring
Venue: IEEE Transactions on Computers (1968)

Abstract It is shown that there exist finite-state universal sequential machines which are also feedback-shift-register realizable. This proves from another point of view the recently proved fact that any arbitrary sequential machine can be realized with two shift registers: one which is not always binary, stores the input, and has no feedback; and the other which is always binary, is driven from the first shift register, and has feedback. In addition, it is proved that the communication between the two shift registers can be reduced to a single binary line.
Cutting two graphs simultaneously
Authors: Viresh Patel
Venue: Journal of Graph Theory (2008)

Consider two graphs, $G_1$ and $G_2$, on the same vertex set V, with $|V|= n$ and $G_{i}$ having $m_{i}$ edges for $i = 1,2$. We give a simple algorithm that partitions V into sets A and B such that $e_{{G}_{1}}(A,B) \geq m_{1}/2$ and $e_{G_{2}}(A,B) \geq m_{2}/2 - \Delta (G_{2})/2$. We also show, using a probabilistic method, that if $G_1$ and $G_2$ belong to certain classes of graphs, (for instance, if $G_1$ and $G_2$ both have a density of at least 2&#x002F;, or if $G_1$ and $G_2$ are both regular of degree at most $(n/16) - 6$ with n sufficiently large) then we can find a partition of V into sets A and B such that $e_{G_{i}}(A,B) \geq m_{i}/2$ for $i = 1,2$. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 57: 19&ndash;32, 2008
Systematic search as a source of technical innovation: An empirical test
Authors: James O. Fiet, William I. Norton,  Jr., Van G. H. Clouse
Venue: Journal of Engineering and Technology Management (2007)

The objective of the study is to increase the probability of identifying venture ideas with commercial potential. To accomplish that objective, we test competing search theories. Historically, the commonly accepted approach to discovery has been alertness, a state of heightened awareness during which one engages in boundaryless search. An emerging approach is constrained, systematic search, which is the application of rigorous search techniques within domains where an entrepreneur is most knowledgeable. We conduct an experiment in which we randomly assign 60 information technology professionals into 2 groups to evaluate these competing search theories. The findings suggest that systematic search is superior to alertness in discovering commercially viable innovations. We also found that systematic search may have pedagogical promise.
Specification of Forms Processing and Business Procedures for Office Automation
Authors: N. C. Shu
Venue: IEEE Transactions on Software Engineering (1982)

Business activities, in general, involve data processing (such as queries, extraction, manipulation, and restructuring of data, etc.) as well as conventional office work centered around preparation, distribution, and filing and retrieval of documents. Convinced that most of these activities can be expressed in terms of forms, we present in this paper a formal means for specification of forms processing. The underlying concept is that business functions can be decomposed into meaningfuliy connected form processes where each process either produces or modifies a form. Powerful constructs are provided so that most of the common data processing activities can be expressed in a very high level, concise, and yet compilable manner.
The Origins of the Teapot
Authors: Frank Crow
Venue: IEEE Computer Graphics and Applications (1987)

Are you interested in more articles of this type? Are you interested in data (such as the teapot data) or code or both? Do you have public domain data and/or code that you would be willing to share? Please send your answers and comments to chip Hatfield, Lawrence Livermore National Laboratory, PO Box 5504, L-156, Livermore, CA 94550 or HATFIELD@LLL-ICDC.ARPA.
Microsystems Introducing a new section...
Authors: D. Allison
Venue: Computer (1977)

A fundamental change is coming about in the nature of the computing industry. The real motivations for the change are the LSI microcomputer and inexpensive memory; the effects are far reaching and occasionally mind boggling. In response to this change, Computer is inaugurating a new section-Microsystems. 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 nonlinear cell macromodel for digital applications
Authors: Chandramouli Kashyap, Chirayu Amin, Noel Menezes, Eli Chiprout
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Current source models have emerged as a promising technique for reducing digital cell netlists to a simpler electrical model for use in timing and other applications. The Multiport Current Source Model (MCSM) is one of the most general models in this class, which has been shown to handle multiple electrical effects including multiple-input switching (MIS) events in timing. However, this new model is hampered by two major problems: port characterization runtime and accuracy across a range of complicated cells which are deployed in advanced microprocessor design such as complex combinational cells, muxes, and sequentials. In this paper we demonstrate a significant leap in modeling accuracy and characterization runtime over the MCSM model which effectively eliminates these remaining issues. The quality of the new approach is conclusively demonstrated on a comprehensive 45nm cell library currently in use. The new approach accurately models both complex combinational as well as, for the first time, sequential cells, and puts MCSMs on the path for next generation gate level electrical analysis.
A Reputation System with Privacy and Incentive
Authors: Yang Bo, Zhou Min, Li Guohuan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Reputation systems are designed for reducing the risk entailed in interactions among total strangers in electronic marketplaces. Such systems can be used to collect and aggregate feedback on the past behavior of participants in electronic transactions, so as to derive reputation scores assumed to predict likely future behavior. Privacy and incentive are mainly concerns in secure reputation systems for feedback providers to providing rating. In this paper, a reputation system is proposed, in which, feedback providers' privacy can be achieved through anonymous technique by using smart card, incentive for feedback provider to provide rating can be achieved through discount token technique by using hash chain.
Novel fuzzy information proximity measures
Authors: Shi-Fei Ding, Shi-Xiong Xia, Feng-Xiang Jin, Zhong-Zhi Shi
Venue: Journal of Information Science (2007)

As a measure of information shared between two fuzzy pattern vectors, the fuzzy information proximity measure (FIPM) plays an important part in fuzzy pattern recognition, fuzzy clustering analysis and fuzzy approximate reasoning. In this paper, two novel FIPMs are set up. Firstly, an axiom theory about the FIPM is given, and different expressions of the FIPM are discussed. A new FIPM is then proposed based on the axiom theory of the FIPM and the concept of fuzzy subsethood function. Two concepts based on the idea of Shannon information entropy, fuzzy joint entropy (FJE) and fuzzy conditional entropy (FCE), are proposed and the basic properties of FJE and FCE are given and proved. Finally, classical similarity measures such as dissimilarity measure (DM) and similarity measure (SM) are studied, and two new measures, fuzzy absolute information measure (FAIM) and fuzzy relative information measure (FRIM), are set up, which can be used as measures of the proximity between fuzzy sets A and B.
Top-Down Layout for Hierarchical Custom Design
Authors: K. Ueda, H. Kitazawa, T. Adachi, I. Harada
Venue: IEEE Design Test (1987)

Champ, a chip floor-plan program, and Alpha, an automatic cell placement and routing system, provide a method for hierarchicalcustom VLSI design that is highly automated and completely top-down. The system can handle standard cell blocks as well asmacro cells such as RAMs, ROMs, PLAs. Champ consists of initial block placement and block packing Designers can execute initialblock placement either manually or automatically using a method based on attractive-repulsive forces. Block packing is performedautomatically or interactively through the moving and reshaping of blocks, which is done as the chip boundaries are beingshrunk. Following the floor-plan design, Alpha automatically executes cell placement and routing. Using Champ/Alpha, onlyseven mandays are needed to design a 20,000-gate VLSI layout, using a predesigned standard cell library and predesigned macrocells.
A New Approach for Construction of Diagnostic Bayesian Network
Authors: Guo Li, Jianmin Gao, Fumin Chen, Zhiyong Gao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Bayesian network is one of the most effective theoretical models applied in the fault diagnostic decision. In order to realize the computer-aided construction of the Bayesian network for diagnostics, this paper proposes a simple, yet comprehensive failure knowledge representation model combined with the structure decomposition of the complex system. Using the polychromatic sets theory, the rock-bottom frame of this model is described in unified mathematical language by means of defining the failure modes as the inherent colors of the physical entities. Then, the Bayesian network is generated automatically with the iterative search process operated on the reasoning matrices of the polychromatic sets. A case study is presented to illustrate the validity of the proposed approach. The research shows that the polychromatic sets approach to the Diagnostic Bayesian Network (DBN) construction has formed mathematical foundation and can be readily expressed and operated by computer.
Combining static and dynamic defect-tolerance techniques for nanoscale memory systems
Authors: Susmit Biswas, Gang Wang, Tzvetan S. Metodi, Ryan Kastner, Frederic T. Chong
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Nanoscale technology promises dramatically increased device density, but also decreased reliability. With bit error rates projected to be as high as 10%, designing a usable nanoscale memory system poses a significant challenge. In particular, we need to bootstrap a sea of unreliable bits into contiguous address ranges which are preferably as large as 4K-byte virtual memory pages. We accomplish this bootstrapping through a combination of dynamic error correction codes within 32-bit blocks and a static defect map which tracks usability of these blocks. The key insight is that statically-determined defect locations can be much more powerful than dynamically correcting for unknown locations, but that defect maps are only practical at a coarse granularity. Using a combination of BCH error correction codes and a Bloom-Filter-based defect map, we achieve a memory efficiency of 60% and 13% for 4K-byte pages at 1% and 10% bit-error rates, respectively.
Incremental Learning of First Order Logic Theories for the Automatic Annotations of Web Documents
Authors: F. Esposito, S. Ferilli, N. Di Mauro, T. Basile
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Organizing large repositories spread throughout the most diverse Web sites rises the problem of effective storage and efficient retrieval of documents. This can be obtained by selectively extracting from them the significant textual information, contained in peculiar layout components, that in turn depend on the identification of the correct document class. The continuous flow of new and different documents in a weakly structured environment like the Web calls for in- crementality, as the ability to continuously update or revise a faulty knowledge previously acquired, while the need to express structural relations among layout components sug- gest the exploitation of a powerful and symbolic represen- tation language. This paper proposes the application of in- cremental first-order logic learning techniques in the docu- ment layout preprocessing steps, supported by good results obtained in experiments on a real dataset.
Provably secure ciphertext policy ABE
Authors: Ling Cheung, Calvin Newport
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on attributes. Decryption is enabled if and only if the user's attribute set satisfies the ciphertext access structure. This provides fine-grained access control on shared data in many practical settings, e.g., secure database and IP multicast. In this paper, we study CP-ABE schemes in which access structures are AND gates on positive and negative attributes. Our basic scheme is proven to be chosen plaintext (CPA) secure under the decisional bilinear Diffie-Hellman (DBDH) assumption. We then apply the Canetti-Halevi-Katz technique to obtain a chosen ciphertext (CCA) secure extension using one-time signatures. The security proof is a reduction to the DBDH assumption and the strong existential unforgeability of the signature primitive. In addition, we introduce hierarchical attributes to optimize our basic scheme - reducing both ciphertext size and encryption/decryption time while maintaining CPA security. We conclude with a discussion of practical applications of CP-ABE.
Spanning-tree based autoconfiguration for mobile ad hoc networks
Authors: Longjiang Li, Yunze Cai, Xiaoming Xu
Venue: Wireless Personal Communications: An International Journal (2007)

In order to allow truly spontaneous and infrastructureless networking, autoconfiguration algorithm is needed in the practical usage of most mobile ad hoc networks (MANETs). This paper presents spanning-tree based autoconfiguration for mobile ad hoc networks, a novel approach for the efficient distributed address autoconfiguration. With the help of the spanning tree, the proposed scheme attempts to distribute address resources as balanced as possible at the first beginning. Since each node holds a block of free addresses, a newly joining node can obtain a free address almost immediately. Subnet partitioning and merging are well supported. Finally, analysis and simulation demonstrate that our algorithm outperforms the existing approaches in terms of both communication overhead and configuration latency.
Sum-max monotonic ranked joins for evaluating top-k twig queries on weighted data graphs
Authors: Yan Qi, K. Selçuk Candan, Maria Luisa Sapino
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with the nodes and edges of the graph, denoting application specific desirability/penalty assessments, such as popularity, trust, or cost. A particular challenge when considering such weights in query processing is that results need to be ranked accordingly. Answering keyword-based queries on weighted graphs is shown to be computationally expensive. In this paper, we first show that answering queries with further structure imposed on them remains NP-hard. We next show that, while the query evaluation task can be viewed in terms of ranked structural-joins along query axes, the monotonicity property, necessary for ranked join algorithms, is violated. Consequently, traditional ranked join algorithms are not directly applicable. Thus, we establish an alternative, sum-max monotonicity property and show how to leverage this for developing a self-punctuating, horizon-based ranked join (HR-Join) operator for ranked twig-query execution on data graphs. We experimentally show the effectiveness of the proposed evaluation schemes and the HR-join operator for merging ranked sub-results under sum-max monotonicity.
Domain knowledge conceptual inter-media indexing: application to multilingual multimedia medical reports
Authors: Jean-Pierre Chevallet, Joo-Hwee Lim, Diem Thi Hoang Le
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Conceptual Indexing is a way to produce only one index for many multilingual documents. Inter-Media conceptual indexing promotes the use of common concepts between two media in order to use a single index for several media. In this paper we explore such an advance indexing point of view. We show the benefit of an automatic conceptual indexing for texts and its extension for text and image documents. Tests are conducted on the multilingual image and text medical document corpus of the CLEF initiative, where we obtain best results on text in 2005 and 2006, and show promising results on images, and best results for the combination of image and text.
A multi-modal mobile device for learning japanese kanji characters through mnemonic stories
Authors: Norman Lin, Shoji Kajita, Kenji Mase
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

We describe the design of a novel multi-modal, mobile computer system to support foreign students in learning Japanese kanji characters through creation of mnemonic stories. Our system treats complicated kanji shapes as hierarchical compositions of smaller shapes (following Heisig, 1986) and allows hyperlink navigation to quickly follow whole-part relationships. Visual display of kanji shape and meaning are augmented with user-supplied mnemonic stories in audio form, thereby dividing the learning information multi-modally into visual and audio modalities. A device-naming scheme and color-coding allow for asynchronous sharing of audio mnemonic stories among different users' devices. We describe the design decisions for our mobile multi-modal interface and present initial usability results based on feedback from beginning kanji learners. Our combination of mnemonic stories, audio and video modalities, and mobile device provide a new and effective system for computer-assisted kanji learning.
Minicomputers in Security Dealing
Authors: B. R. Gaines
Venue: Computer (1976)

There are many business applications which fit far better the terminology and techniques of industrial control than they do that of conventional data processing. A dealer in any commodity whose price is continually fluctuating, be it money, stocks, or physical supplies, requires real-time information about the deals of his colleagues and competitors and the state of the market: he requires on-stream processing of this continually changing information against an on-line file system of historic data acquired about the market. His communication needs are best satisfied by interaction through visual displays even though his data processing requirements are those generally associated with small batch-processing EDP machines.