ppxscal/embedding_network huggingface dataset:
Authentication and Micropayment Protocols based on Self-Updating Hash Chains
Authors: Li Chen, Haojun Zhang, Nan Liu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Ji et al improved R.Revest's PayWord protocol based on hash chains and proposed a micropayment protocol which had better features on security and fairness, but it did not solve the problems of malicious overdraft and timeliness. Furthermore its efficiency and security was restricted by the inherent shortcoming of conventional hash chains. The paper proposes an authentication protocol for M-commerce based on Self- Updating Hash Chains scheme, and designs a micropayment protocol. The protocols fit scenario of micropayment such as information commodity between a mobile user and a fixed service provider. The analyses show that the proposed authentication protocol needs fewer messages to authenticate mobile user in the foremost time, session keys are negotiated efficiently, as well as fine-authentication is realized. The proposed protocols do not only solve the problems existed in Ji's protocol, but also have better features on security, efficiency and fairness.
Effective ranked conceptual retrieval
Authors: Amjad M. Daoud
Venue: Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience (2007)

We describe the design and implementation of the SMARTER prototype system for collecting, structuring and searching information derived from full text ebooks available on the World Wide Web [4]. Standard methods of parsing and extended Boolean schemes for weighting are used to build an index of individual pages. Ranked pages are retrieved from the system by means of a correlated and combined p-norm and vector query mechanisms. Furthermore, we present a complete evaluation of the relative effectiveness of the SMARTER system versus the Google Desktop [7].
A Very High-Level Interactive Graphical Trace for the Pascal Heap
Authors: S. L. Getz
Venue: IEEE Transactions on Software Engineering (1983)

A very high-level trace for data structures is one which displays a data structure in the shape in which the user conceptualizes it, be it a tree, an array, or a graph. GRAPHTRACE is a system that facilitates the very high-level graphic display of interrelationships among dynamically allocated Pascal records. It offers the user a wide range of options to enable him to "see" the data structures on a graphics screen in a format as close as possible to that in which he visualizes it, thereby providing a useful display capability when the user's conceptual model is a directed graph or tree.
Unknown Moving Target Detecting and Tracking Based on Computer Vision
Authors: Yang Shu-Ying, Zhang Cheng, Zhang We-Yu, He Pi-Lian
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper, we applied inter-frame difference and optical flow algorithm to detect unknown moving target, and used the particle filter algorithm to track the detected moving target. Because the compute time of optical flow is long, we use inter-frame difference method to extract approximate target region and then calculate local optical flow. A dynamic elliptical template with affine transformations was constructed and a dynamic motion model was established to predict particle state. The complex moment was used as the feature in the reference region and candidate regions. At the same time the Gaussian function was used to calculate particle weights so that the particles with small weights were resampled. Finally, the tracking object state was computed by using particles weighted sum. Experiment results show that the speed of recognizing and tracking moving target is improved and the template can dynamically do some affine transformations with the moving target.
RECN-IQ: A Cost-Effective Input-Queued Switch Architecture with Congestion Management
Authors: Gaspar Mora, Pedro J. Garcia, Jose Flich, Jose Duato
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

As the number of computing and storage nodes keeps increasing, the interconnection network is becoming a key element of many computing and communication systems, where the overall performance directly depends on network performance. This performance may dramatically drop during congestion situations. Although congestion may be avoided by overdimensioning the network, the current trend is to reduce overall cost and power consumption by reducing the number of network components. Thus, the network will be prone to congestion, thereby becoming mandatory the use of congestion management techniques. In that sense, the technique known as Regional Explicit Congestion Notification (RECN) completely eliminates the Head-of-Line (HOL) blocking produced by congested packets, turning congestion harmless. However, RECN has been designed for switches with queues at input and output ports (CIOQ switches), thus it can not be directly applied to other types of switches. Additionally, the method RECN uses for detecting congestion requires several detection queues that increase the memory requirements and thus switch cost. Thus, we completely redefine the RECN mechanism in order to achieve different goals. First, we adapt RECN to a switch organization with queues only at input ports (IQ switches). These switches are simpler and cheaper to produce than CIOQ ones. Second, we propose a new method for detecting congestion that does not require several detection queues, thereby reducing RECN memory requirements. These improvements lead to achieve a cost-effective switch organization that derive maximum performance even in the presence of congestion. Also, we present in detail a realistic switch architecture supporting the new mechanism. Results demonstrate that the new RECN version in an IQ switch achieves maximum network performance in all the analyzed situations. These results have been obtained with a reduction factor of data memory requirements of 5 with respect to the previous RECN mechanism in CIOQ switches.
SWARD: Semantic Web Abridged Relational Databases
Authors: Johan Petrini, Tore Risch
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

We have developed a system that can process queries to RDF views of large relational databases. This provides very flexible views of wrapped databases that can be queried using either RDQL or SQL. Query processing over such views is challenging because their naive implementation becomes very complex. This makes it critical to optimize not only data access time but also the time to perform the query optimization itself. We have developed query processing techniques based on partial evaluation of query expressions as a way to enable execution of real-world queries to RDF views of relational databases.
Fault and adversary tolerance as an emergent property of distributed systems' software architectures
Authors: Yuriy Brun, Nenad Medvidovic
Venue: Proceedings of the 2007 workshop on Engineering fault tolerant systems (2007)

Fault and adversary tolerance have become not only desirable but required properties of software systems because mission-critical systems are commonly distributed on large networks of insecure nodes. In this paper, we describe how the tile style, an architectural style designed to distribute computation, can inject fault and adversary tolerance. The result is a notion of tolerance that is entirely abstracted away from the functional properties of the software system. The client may specify what fraction of the network is faulty or malicious (e.g., 25%) and the acceptable system failure rate (e.g., 2-10), and the system's architecture adjusts automatically to ensure a failure rate no higher than the one specified. The technique is entirely automated and consists of a "smart redundancy" mechanism that brings the failure rate exponentially close to 0 by slowing down the execution speed linearly.
On the Generalized Binary System
Authors: L. N. Bhuyan
Venue: IEEE Transactions on Computers (1982)

In this correspondence we derive algorithms for multioperand addition of Koren's generalized number system. A carry-lookahead adder for fast addition of two operands in generalized binary numbers is developed. Truncation errors for this type of representation are examined and rounding algorithms are presented to reduce these errors.
A Selection Model for Multiple Design Schemes of Complex Product
Authors: Zaifang Zhang, Xuening Chu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Design scheme selection is an important step and strategic issue for complex product development. However, it is more difficult to evaluate scheme directly due to product complexity and evaluating process uncertainty. In this paper, a novel selection model is proposed through quality function deployment (QFD) with group decision-making. In this model, each parts scheme which outline design schemes are divided into is evaluated through group decision-making, and parts weights are determined by QFD approach. All design schemes are order-sorted and selected based on multiplying parts scheme evaluation values with weights of parts. This model is illustrated with a case concerning the product design scheme selection of horizontal directional drilling. Key words: Scheme selection; Quality function deployment; Group decision-making
A Distributed Workstation Architecture: The Convergent Cluster
Authors: Barry Kelman
Venue: IEEE Computer Graphics and Applications (1984)

The cluster architecture allows resource sharing by up to 16 users and takes advantage of today's LSI technology to achieve high throughput at reasonable costs. 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
Distributed Scheduling Strategies for Processing Multiple Divisible Loads with Unknown Network Resources
Authors: He Li, Guangzhong Sun, Yinlong Xu
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

The problem of scheduling multiple divisible loads on bus networks with unknown parameters is addressed this paper. Most research in optimal partitioning of massive loads to be distributed among processors in a distributed system is under the assumptions of known and deterministic network resources. Lately, researchers have started addressing issues that are application oriented and go beyond those simple assumptions of load distribution. In this paper, a heterogeneous network with unknown network resources is considered, and several strategies with increasing refinements that minimize the total processing time of multiple divisible loads are designed. These strategies perform close to the real distributed systems more and more. Application comparison of these proposed strategies is carried out.
The Evolution of Programs: Automatic Program Modification
Authors: N. Dershowitz
Venue: IEEE Transactions on Software Engineering (1977)

An attempt is made to formulate techniques of program modification, whereby a given program that achieves one goal can be transformed into a new program that uses the same principles to achieve a different goal. For example, a program that uses the binary search paradigm to calculate the square root of a number may be modified to divide two numbers in a similar manner, or vice versa. The essence of the approach is to find an analogy between the specifications of the given and desired programs, and then to transform the given program accordingly.
Exploitng Program Concurrency in Computing Systems
Authors: P. C. Treleaven
Venue: Computer (1979)

The solution of many large computational problems is an inherently concurrent process. But most existing computing systems are inherently sequential. This mismatch may be overcome by data-flow computing.
Improvement of UV-moulding accuracy by heat and solvent assisted process
Authors: Juha Pietarinen, Valtteri Kalima, Tuula T. Pakkanen, Markku Kuittinen
Venue: Microelectronic Engineering (2008)

A micro-optics replication process with UV-curable liquid pre-polymers is considered. Filling of the master structure is improved by controlling the viscosity of the pre-polymer by heat during the process. A novel process step, solvent-assisted filling, is introduced to avoid the harmful effect of the residual trapped air; a pyramidal retro-reflector structure with the face width of 400@mm is used as an example. Complete filling can be achieved without vacuum assisted replication or without application of compression force in the mould. Material studies showed no signs of chemical changes, solvent inclusion in the replicated structure, or a change of the optical properties of the material during the process. The replication fidelity is compared with conventional UV-moulding and commercial UV-NIL replication. The new heat and solvent assisted replication technique allows the use of high-viscosity pre-polymers with suitable material properties if the process temperature window is optimized.
Fuzzy Logic and its Application to Switching Systems
Authors: P. N. Marinos
Venue: IEEE Transactions on Computers (1969)

Fuzzy logic deals with propositions which may be ascribed values between falsehood and truth (0 and 1) subjectively in either a continuous or a discrete fashion. This is in contrast to ordinary logic (two-valued or k-valued logic) in which a given proposition is ascribed values objectively using either deterministic or probabilistic approaches.
"Ideal Parent" Structure Learning for Continuous Variable Bayesian Networks
Authors: Gal Elidan, Iftach Nachman, Nir Friedman
Venue: The Journal of Machine Learning Research (2007)

Bayesian networks in general, and continuous variable networks in particular, have become increasingly popular in recent years, largely due to advances in methods that facilitate automatic learning from data. Yet, despite these advances, the key task of learning the structure of such models remains a computationally intensive procedure, which limits most applications to parameter learning. This problem is even more acute when learning networks in the presence of missing values or hidden variables, a scenario that is part of many real-life problems. In this work we present a general method for speeding structure search for continuous variable networks with common parametric distributions. We efficiently evaluate the approximate merit of candidate structure modifications and apply time consuming (exact) computations only to the most promising ones, thereby achieving significant improvement in the running time of the search algorithm. Our method also naturally and efficiently facilitates the addition of useful new hidden variables into the network structure, a task that is typically considered both conceptually difficult and computationally prohibitive. We demonstrate our method on synthetic and real-life data sets, both for learning structure on fully and partially observable data, and for introducing new hidden variables during structure search.
A Fast Algorithm for Computing the Contribution of a Point to the Hypervolume
Authors: XiuLing Zhou, Ning Mao, WenJuan Li, ChengYi Sun
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A fast algorithm, called the contribution of a point to the hypervolume by Slicing Objective (CHSO) algorithm, is presented for computing the contribution of a point to the hypervolume directly. It is based on the same idea as HSO algorithm by processing the objectives in a front one at a time, rather than the points one at a time as in LAHC algorithm. It is shown that CHSO is much faster than LAHC for randomly generated data and benchmark data in three to eight objectives. So CHSO will enable the use of hypervolume as a diversity mechanism with larger population in more objectives.
Extending ICA for finding jointly dependent components from two related data sets
Authors: Juha Karhunen, Tomas Ukkonen
Venue: Neurocomputing (2007)

In this paper, we introduce some methods for finding mutually corresponding dependent components from two different but related data sets in an unsupervised (blind) manner. The basic idea is to generalize cross-correlation analysis by taking into account higher-order statistics. We propose independent component analysis (ICA) type extensions for the singular value decomposition of the cross-correlation matrix. They extend cross-correlation analysis in a similar manner as ICA extends standard principal component analysis for covariance matrices. We present experimental results demonstrating the usefulness of the proposed methods both for artificially generated data and for a cryptographic problem.
A relational approach to incrementally extracting and querying structure in unstructured data
Authors: Eric Chu, Akanksha Baid, Ting Chen, AnHai Doan, Jeffrey Naughton
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

There is a growing consensus that it is desirable to query over the structure implicit in unstructured documents, and that ideally this capability should be provided incrementally. However, there is no consensus about what kind of system should be used to support this kind of incremental capability. We explore using a relational system as the basis for a workbench for extracting and querying structure from unstructured data. As a proof of concept, we applied our relational approach to support structured queries over Wikipedia. We show that the data set is always available for some form of querying, and that as it is processed, users can pose a richer set of structured queries. We also provide examples of how we can incrementally evolve our understanding of the data in the context of the relational workbench.
Automatic Analog Testing - 1979 Style
Authors: W. A. Plice
Venue: Computer (1979)

The bewildering changes currently facing designers and users of analog test equipment are leading to new techniques and improved hardware that should reduce test time by a factor of four within the next decade. 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
Node Availability for Distributed Systems considering processor and RAM utilization
Authors: Antonio Menendez L.C., Hector Benitez-Perez, M. A. Palomera-Perez
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

This paper presents a metric named Node-Availability based on the processor and RAM utilization. This metric is used to achieve load-balancing in distributed systems, without previously knowing the execution time of the processes, nor the processes communication requirements. It also presents, a case study to show that the metric is feasible to implement in a dynamic load-balancing algorithm obtaining an acceptable performance.
Component-Based and Service-Oriented Software Engineering: Key Concepts and Principles
Authors: Hongyu Pei Breivold, Magnus Larsson
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Component-based software engineering (CBSE) and service-oriented software engineering (SOSE) are two of the most dominant engineering paradigms in current software community and industry. Although they have continued their development tracks in parallel and have different focus, both paradigms have similarities in many senses, which also have resulted in confusion in understanding and applying similar concepts or the same concepts designated differently. In this paper, we present a comparison analysis framework of CBSE and SOSE and analyze them from a variety of perspectives. We discuss as well the possibility of combining the strengths of the two paradigms to meet non-functional requirements. The contribution of this paper is to clarify the characteristics of CBSE and SOSE, shorten the gap between them and bring the two worlds together so that researchers and practitioners become aware of essential issues of both paradigms, which may serve as inputs for further utilizing them in a reasonable and complementary way.
A comparative study of SPI Approaches with ProPAM
Authors: Paula Ventura Martins, Alberto Rodrigues da Silva
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

Software Process Improvement (SPI) is one of the main software development challenges. Unfortunately, process descriptions generally do not correspond to the processes actually performed during software development projects. They just represent high-level plans and do not contain the information necessary for the concrete software projects. This deficient alignment between the process and project is caused by processes that are unrelated to project activities and failure in detecting project changes to improve the process. Process and project alignment is essential to really find out how process management is important to achieve an organization's strategic objectives. Considering this approach, this paper presents a comparative study of some of the most recognized SPI approaches and a new software process improvement methodology proposed, designed by Process and Project Alignment Methodology (ProPAM). Our intention is to show the problems observed in existing SPI approach and recognize that further research in process and project alignment based on actor oriented approaches is required.
Family life in the digital home -- domestic telecommunications at the end of the 20th century
Authors: B. Anderson, A. Mcwilliam, H. Lacohée, E. Clucas, J. Gershuny
Venue: BT Technology Journal (2007)

This paper describes results from the first stage of a long-term study of people's use of ICT (information and communications technology) products and services in the domestic environment. It is part of BT's ongoing commitment to understanding, modelling and meeting the needs of its residential customers. At one level the research has already generated significant knowledge that has led directly to commercial benefit; at a second it has validated a number of research methods needed to capture the data to build a rich picture of people's actual as well as reported behaviour. At a third level it has also generated significant new scientific knowledge about the use of ICT products.The next step is to build on these successes using a 1000 strong UK household panel to build an unprecedented and unparalleled understanding of how and why people purchase, adapt and adapt to ICT as UK society moves into the 21st century.
Practical use of non-local features for statistical spoken language understanding
Authors: Minwoo Jeong, Gary Geunbae Lee
Venue: Computer Speech and Language (2008)

Spoken language understanding (SLU) addresses the problem of mapping natural language speech to frame structure encoding of its meaning. The statistical sequential labeling method has been successfully applied to SLU tasks; however, most sequential labeling approaches lack long-distance dependency information handling method. In this paper, we exploit non-local features as an estimate of long-distance dependencies to improve performance of the statistical SLU problem. A method we propose is to use trigger pairs automatically extracted by a feature induction algorithm. We describe a light practical version of the feature inducer for which a simple modification is efficient and successful. We evaluate our method on three SLU tasks and show an improvement of performance over the baseline local model.
A new projection and convergence theorems for the projections in Banach spaces
Authors: Takanori Ibaraki, Wataru Takahashi
Venue: Journal of Approximation Theory (2007)

In this paper, we introduce a new projection in a Banach space and show an example of the projections. Then, we study the Mosco convergence of a sequence of nonempty sets concerning the projections in a Banach space.