ppxscal/embedding_network huggingface dataset:
Dual Processor Performance Characterization for XML Application-Oriented Networking
Authors: Jianxun Jason Ding, Abdul Waheed
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

There is a growing trend to insert application intelligence into network devices. Processors in this type of Application-Oriented Networking (AON) devices are required to handle both packet-level network I/O intensive operations as well as XML message-level CPU intensive operations. In this paper, we investigate performance effect of dual processing via (1) Hyperthreading, (2) uni-processor to dualprocessor, and (3) single-core to dual-core, on both packet-level and XML message-level traffic. We analyze and cross-examine the dual processing effect from both high-level performance as well as processor microarchitectural perspectives. We employ on-chip performance counters to measure cycles per instruction, cache misses, bus utilization, and branch miss predictions for this work. Our results show a significant improvement in dual-core Pentium M processor over Hyperthreaded Xeon processor for AON workload. These results will not only provide insight to processor designers, but also help architects of AON devices to select from alternative processors with restrictions to use one or two physical CPUs due to space and power consumption limitations.
A Novel MIMO-Aware Distributed Media Access Control Scheme for IEEE 802.11 Wireless Local Area Networks
Authors: Dan J. Dechene, Khalim Amjad Meerja, Abdallah Shami, Serguei Primak
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper proposes a new distributed media access control (MAC) scheme to improve the network performance of Multiple-Input Multiple-Output (MIMO) wireless systems. In particular, this novel MAC scheme efficiently schedules two simultaneous transmissions between wireless stations (each equipped with three antennas) that are located in a single collision domain. Along with weighted nulling and intelligent packet fragmentation, this MAC scheme is capable of providing more efficient utilization of channel resources. The proposed MIMO-aware MAC scheme is compatible with the IEEE 802.11 standard. Detailed simulations are carried out to study the performance of the proposed scheme. The performance of the MIMO-aware MAC scheme is also compared with a recently proposed MIMO MAC scheme in the literature which is compatible with the IEEE 802.11 standard. Comparisons reveal that the proposed MIMO-aware MAC scheme achieves better throughput and delay performance under both saturated and unsaturated conditions.
The Structuring Engine: A Transition Tool
Authors: G. de Balbine
Venue: Computer (1975)

In this workshop, the restructuring problem has been alluded to several times. Manual restructuring-i.e., the complete rewrite of a project using top-down design and implementation methods-has been offered as a way of improving existing software. 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
How Important are the Sizes and Locations of Fixation Regions for the BIAS Model?
Authors: Predrag Neskovic, Ian Sherman, Liang Wu, Leon N. Cooper
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this work we consider the Bayesian Integrate And Shift (BIAS) model for learning object categories and investigate its sensitivity to changes in the sizes and locations of fixation regions. We test the model using a face category and show that the learning algorithm is robust to large variations of the regions' sizes and locations. Specifically, we show that the performance is inversely proportional to the sizes of the fixation regions and that the preferred locations are those that are closer to the center of the object.
A Design of User-Initiative Voice Web Using RSS and VoiceXML
Authors: Hyeong-Joon Kwon, Kwang-Seok Hong
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

A voice web accesses web resources via voice and audio. VoiceXML is currently the best solution for construction of a voice web. However voice web using VoiceXML doesn't provide users with dynamic and rich content because a voice web uses machine-controlled and mixed-initiative technology that provides one-sided progress from system to user. In this paper, we recognize the weaknesses of a voice web using technology such as VoiceXML, and design and implement a user-initiative voice web using RSS and VoiceXML. The proposed system provides dynamically detected recognition candidates in user content, in contrast with recognition candidates of the existing voice web, which depend on the application developer. As a result of implementation and experiments with the proposed system, we confirm that users can navigate more freely and efficiently.
Focus on software
Authors: W. Myers
Venue: Computer (1977)

At least 15 percent of the growth in U.S. productivity during the last decade is attributable to computers, according to COMPCON Fall 77 keynoter Mark Shepherd, Jr.,* of Texas Instruments. Addressing an audience of 850 computer system designers at the Mayflower Hotel on Sept. 7 in Washington, the TI board chairman and chief executive officer stressed that the industry will make an even more significant impact on the ecoecoic problems besetting the country if the price/performance ratio of future computer equipment can be improved. 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
Flexible and efficient implementations of Bayesian independent component analysis
Authors: Ole Winther, Kaare Brandt Petersen
Venue: Neurocomputing (2007)

In this paper we present an empirical Bayes method for flexible and efficient independent component analysis (ICA). The method is flexible with respect to choice of source prior, dimensionality and constraints of the mixing matrix (unconstrained or non-negativity), and structure of the noise covariance matrix. Parameter optimization is handled by variants of the expectation maximization (EM) algorithm: overrelaxed adaptive EM and the easy gradient recipe. These retain the simplicity of EM while converging faster. The required expectations over the source posterior, the sufficient statistics, are estimated with mean field methods: variational and the expectation consistent (EC) framework. We describe the derivation of the EC framework for ICA in detail and give empirical results demonstrating the improved performance. The paper is accompanied by the publicly available Matlab toolbox icaMF.
A multi-purpose implementation of mandatory access control in relational database management systems
Authors: Walid Rjaibi, Paul Bird
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Mandatory Access Control (MAC) implementations in Relational Database Management Systems (RDBMS) have focused solely on Multilevel Security (MLS). MLS has posed a number of challenging problems to the database research community, and there has been an abundance of research work to address those problems. Unfortunately, the use of MLS RDBMS has been restricted to a few government organizations where MLS is of paramount importance such as the intelligence community and the Department of Defense. The implication of this is that the investment of building an MLS RDBMS cannot be leveraged to serve the needs of application domains where there is a desire to control access to objects based on the label associated with that object and the label associated with the subject accessing that object, but where the label access rules and the label structure do not necessarily match the MLS two security rules and the MLS label structure. This paper introduces a flexible and generic implementation of MAC in RDBMS that can be used to address the requirements from a variety of application domains, as well as to allow an RDBMS to efficiently take part in an end-to-end MAC enterprise solution. The paper also discusses the extensions made to the SQL compiler component of an RDBMS to incorporate the label access rules in the access plan it generates for an SQL query, and to prevent unauthorized leakage of data that could occur as a result of traditional optimization techniques performed by SQL compilers.
Automatic ROI Selection for JPEG2000 Compression of Remote Sensing Images
Authors: Fei Wang, Jishang Wei, Nanning Zheng, Shaoyi Du, Bin Gao
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Recently, remote sensing images increase greatly in the repositories. To achieve efficient storage and indexing, we introduce a JPEG2000 compression frame which puts emphasis on selection and designation of regions of interest (ROI). Firstly, SIFT is applied for feature extraction, descriptor generation and point matching to locate ROI. Secondly, an approach is proposed for computing transformation parameters such as rotation, scale and translation separately. To get robust results, we put forward an improved RANSAC algorithm with two cost functions to obtain comparative computation efficiency in our application. At last ROI designated is used in JPEG2000 for remote sensing image compression. The method performs great in a series of experiments and satisfying results can be seen.
Best neighbor strategy to enforce cooperation among selfish nodes in wireless ad hoc network
Authors: K. Komathy, P. Narayanasamy
Venue: Computer Communications (2007)

Trust among nodes in a self-organizing network such as a mobile ad hoc network presents a number of problems and paradoxes. One of the challenging characteristics of wireless and mobile ad hoc networks consists in exploring ways to cope up with selfish behavior of neighbors towards network functions such as routing and forwarding. This paper attempts to deal with such mechanisms and as a result it introduces a distinct model to study the behavior of selfish neighbors using strategic, non-cooperative game theory. Many research works have used Tit-For-Tat strategy for analysis when they deploy game theory to stimulate cooperation. A compliant and an adaptable strategy called Best Neighbor Strategy [BNS] is proposed in this paper for the packet forwarding game in a wireless ad hoc environment. The behavior of nodes is probed varying the proportion of selfishness and also the size of the population while forwarding the packets. The investigations have brought out that the proposed cooperation enforcement policy is scalable, is able to converge faster and is robust against selfishness. BNS achieves evolutionary stability even under the invasion of selfish strategy at different proportions. Further, BNS proves to be a pure evolutionary stable strategy as it evolves to dominate the population from whatever the initial frequency it starts with and it totally out-competes the malign behavior shown by selfish strategy, which means that BNS is immune to invaders. The observations and analysis have shown that the ad hoc paradigm can be modeled significantly using an approach, which has been developed for game theory.
Royalties and Taxes: Making Money on the Net
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2007)

The Internet's decentralized, distributed nature has often confounded those with vested interests in economic models the network appears to change or circumvent. One of those issues, the battle over royalty rates due musicians from Internet broadcasters, is at fever pitch. Its results could have profound ramifications for online entertainment's economic structure and pace of technological innovation. A second issue—how to tax online purchases equitably, if at all—is once more being dissected in policymaking bodies around the globe. And once more, it's revealing the complexities of trying to level the Internet-enabled economic playing field among taxing jurisdictions.
A Robust Object Tracking Approach using Mean Shift
Authors: Zhiqiang Wen, Zixing Cai
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Background pixels in object model will increase localization error of object tracking, but in order to let the object contained in object model, it is inevitable to introduce some background pixels in object model. For reducing the localization error of object tracking, a straightforward approach is to omit the background pixels when the kernel histogram of object model is being computed, but there are many knotty problems for it. A weight parameter integrating background features is used in object model in this paper. The weight parameter indicates the similarity between background feature and object feature and can reduce localization error of object tracking. The experimental results show our approach has good localization precision of object tracking, and is robust against occlusion.
Agile's Coming of Age ... or Not
Authors: Hakan Erdogmus
Venue: IEEE Software (2007)

The agile software development movement is displaying signs of maturity, with sobering, reconciliatory, and reflective undertones. An unscientific, informal survey of attendees at the Agile 2007 conference yielded several interesting results. Most respondents were not newcomers to the agile field. A small majority of respondents believed that agile had come of age and become mainstream. And an overwhelming majority said that "agile" had become a buzzword and that the field had had impact.
A combined framework for grouping and order optimization
Authors: Thomas Neumann, Guido Moerkotte
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Since the introduction of cost-based query optimization by Selinger et al. in their seminal paper, the performance-critical role of interesting orders has been recognized. Some algebraic operators change interesting orders (e.g. sort and select), while others exploit them (e.g. merge join). Likewise, Wang and Cherniack (VLDB 2003) showed that existing groupings should be exploited to avoid redundant grouping operations. Ideally, the reasoning about interesting orderings and groupings should be integrated into one framework. So far, no complete, correct, and efficient algorithm for ordering and grouping inference has been proposed. We fill this gap by proposing a general two-phase approach that efficiently integrates the reasoning about orderings and groupings. Our experimental results show that with a modest increase of the time and space requirements of the preprocessing phase both orderings and groupings can be handled at the same time. More importantly, there is no additional cost for the second phase during which the plan generator changes and exploits orderings and groupings by adding operators to subplans.
Design and simulation for three SEU immune latches in a 0.18µm CMOS commercial process
Authors: Yuhong Li, Suge Yue, Yuanfu Zhao, Guozhen Liang
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

This paper reports three SEE (single event effect) immune latches designed in a 0.18µm CMOS commercial process, which are based on three memory cells having appeared in the recent years: HIT(Heavy Ion Tolerant cell), DICE(Dual Interlocked storage cell) and GDICE(DICE with guard-gates). An improvement for the later two latches drastically reduces static power consumption, decreases the number of transistors and enhances the SET (single event transient) immunity. Advantages and disadvantages of the three latches are enumerated apart. A simulation model for the SET on the sensitive node is proposed. It can be used for comparing the SEU (single event upset) immunity of the three latches. Some advices for layout design about SEE-hardening are provided. According to the simulation, it can be concluded that DICE latch and GDICE latch are less SEU-sensitive when only one sensitive node was stricken, but the HIT latch is less SEU sensitive when two nodes were stricken, if the special layout is regardless.
Built-In Self-Testing RAM: A Practical Alternative
Authors: Kewal Saluja, Siew Sng, Kozo Kinoshita
Venue: IEEE Design Test (1987)

The article investigates the design of a built-in self-testing RAM as an economical way, in terms of silicon area overhead,to test memories?more economical than the use of external testers. The design of a BIST static RAM is given, along with designdecisions, retrospectives on how design could have used the area even more efficiently, and results of implementation. Theextra silicon area used by the BIST hardware for 64K static memories is only five percent; for larger memories, it is less.BIST RAM, then, is a practical alternative, especially since testing can be done even during burn-in without the aid of anexpensive external tester.
Robust Algorithm of Vehicle Classification
Authors: Shengli Shi, Zhong Qin, Jianmin Xu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Automatic Vehicle Classification becomes more so essential to the electric toll collection of highways and other related applications in intelligent transportation system. A novel and robust vision-based vehicle classification algorithm for highway toll is proposed in this paper. The algorithm focuses on a vehicle's length, height and width dimension parameters detected simply by a single camera. Multi-sensors are utilized for aided estimating the vehicle, which are well complementary equipments for classifying the passing vehicles. And experimental results show that the proposed algorithm is valuable and correct.
The MarineGrid project in Ireland
Authors: M. P. Kenirons, J. Ryan, J. Cunniffe, O. Curran, S. Bourke, A. Shearer
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

The Geological Survey of Ireland (G.S.I) at present has over 4 terabytes of multi-beam sonar data gathered over the last five years from the seabed within the Irish designated zone as part of the Irish National Seabed Survey (INSS) and this data-set is expected to exceed 10 terabytes upon completion. Geological interpretation is carried out by visual inspection of bathymetric patterns. Due to the size of this data set and the emergence of similar data sets, the extraction of knowledge from such a data sets by human observers has become infeasible. The focus has turned to using artificial intelligence and computational methods for assistance. The commercial and environmental sensitivity of the data means that secure data processing and transmission are of paramount importance. This has lead to the creation of the MarineGrid project within the Grid Ireland organization. New method's have been developed for statistical analysis of bathymetric information specifically for automated geological interpretation of rock types on the sea floor and feature extraction from the sea floor. In this poster we present a brief synopsis of both a classification algorithm and a feature extraction algorithm and the results obtained from within the NUI Galway MarineGrid project.
Hardness and approximation results for packing steiner trees
Authors: Joseph Cheriyan, Mohammad R. Salavatipour
Venue: Algorithmica (2006)

We study approximation algorithms and hardness of approximation for several versions of the problem of packing Steiner trees. For packing edge-disjoint Steiner trees of undirected graphs, we show APX-hardness for four terminals. For packing Steiner-node-disjoint Steiner trees of undirected graphs, we show a logarithmic hardness result, and give an approximation guarantee ofO (&#x221a;n logn), wheren denotes the number of nodes. For the directed setting (packing edge-disjoint Steiner trees of directed graphs), we show a hardness result of &#x0398;(m 1/3/&#x2212;&#x025b;) and give an approximation guarantee ofO(m 1/2/+&#x025b;), wherem denotes the number of edges. We have similar results for packing Steiner-node-disjoint priority Steiner trees of undirected graphs.
DAC Highlights
Authors: Sachin Sapatnekar, Leon Stok
Venue: IEEE Design Test (2007)

The 44th Design Automation Conference (DAC) was held on 4-8 June 2007 in San Diego, California, and brought together design engineers, managers, developers, and researchers from industry and academia. This report provides a short summary of the technical trends in this premier event on electronic design automation and silicon solutions.
Operating system support for execution time budgets for thread groups
Authors: Mario Aldea Rivas, Michael González Harbour
Venue: Proceedings of the 13th international workshop on Real-time Ada (2007)

The recent Ada 2005 standard introduced a number of new real-time services, with the capability of creating and managing execution time budgets for groups of tasks. This capability has many practical applications in real-time systems in general, and therefore it is also interesting for real-time operating systems. In this paper we present an implementation of thread group budgets inside a POSIX real-operating system, which can be used to implement the new Ada 2005 services. The architecture and details of the implementation are shown, as they may be useful to other implementers of this functionality defined in the new standard.
Currently Available Program Testing Tools: Technology abd Experience
Authors: L. G. Stucki
Venue: Computer (1975)

Complementing the 1975 International Cnference on Reliable Soft-held April 21-23 in Los Angeles (see May Computer), a workshop was held April 24-25 to survey the current status of program testing tools. Co- sponsored by the U.S. National Bureau of Standards, ACM, and the IEEE Computer Society (Technical Committee on Software Engineering), the workshop was held at the Airport Marina in Los Angeles on 24-25 April 1975. Attendance was 160 and represented many diverse interests. The fact that software is rapidly becoming recognized, by those outside as well as inside the programming profession, as one of the most complex human activities yet undertaken-set the stage for the discussions which emerged.
An Open-Source Component-Based Toolkit to Support E-learning Multimedia Environments
Authors: Thiago Bruno Melo de Sales, Ivo Augusto A. R. Calado, Manoel Teixeira de Abreu Netto, Evandro de Barros Costa, Henrique Pacca Loureiro Luna, Leandro Melo de Sales, Marcello Alves de Sales Junior
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

In the Distributed Systems area, the number of Multimedia Applications has increased due to fact that it provides a better integration among their users, as well as being recognized as an essential distinctive feature for e-learning environments. However, most of the existing e-learning solutions are not open-source and are not designed with extensibility in mind, making integration with other systems difficult. In this way, this paper proposes an open-source component-based toolkit to support e-learning multimedia environments called ArCoLIVE, which offers real time multimedia services for e-learning systems.