ppxscal/embedding_network huggingface dataset:
Vision-Guided "Point and Click" for Smart Rooms
Authors: Mark Adler, Franklin Reynolds
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Pointing is a natural method for humans to use to indicate a focus of their attention. Over the years, the ubiquitous, infra-red remote control has been used to control a variety of appliances by pointing. Despite its success, infra-red based pointing solutions have some limitations. In our research, we have explored other ways for mobile users to select objects inside a smart room via pointing or similar gesture. In this paper we describe the use of mobile phones with cameras as pointing devices to interact with smart environments. Mobile users select an object by simply taking a picture of it. We rely on two key ideas to simplify the image-processing problem: objects that can be recognized visually contain image-processing hints in their descriptions, and all the objects (and their descriptions) in the vicinity of the user can be found by a location-aware discovery protocol. The paper describes the design of a location-aware service discovery protocol, the integration of the service discovery protocol with image capture and analysis and our experience with a smart room application that uses image capture and recognition to select physical objects.
A Dynamic Service Composition Model Based on Constraints
Authors: Haiyan Zhao, Hongxia Tong
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

As a way to compose separate services together to fulfill a function, service workflow is widely accepted and applied in different applications. One key issue in service workflow is how to configure the general service workflow into a specialized one that can satisfy user's individual requirements. A service composition model based on constraints is introduced in the paper. In this model user's requirement is modeled as constraints, which is further categorized into constraint related to static quality index and dynamic quality index type. The configuration engine can search the service according to the constraint model so that an abstract service workflow can be transformed into the concrete service workflow by binding each activity with concrete service. The framework for service composition together with how to represent the user's requirement as constraints and the configuration process are introduced.
Scalability of Hybrid Fuzzy C-Means Algorithm Based on Quantum-Behaved PSO
Authors: Hao Wang, Shiqin Yang, Wenbo Xu, Jun Sun
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

A new hybrid fuzzy clustering algorithm that incorporates the Fuzzy C-means (FCM) into the Quantum-behaved Particle Swarm Optimization (QPSO) algorithm is proposed in this paper (QPSO+FCM). The QPSO has less parameters and higher convergent capability of the global optimizing than Particle Swarm Optimization algorithm (PSO). So the iteration algorithm is replaced by the QPSO based on the gradient descent of FCM, which makes the algorithm have a strong global searching capacity and avoids the local minimum problems of FCM and in a large degree avoids depending on the initialization values. This paper also investigates the ability of FCM algorithm, PSO+FCM algorithm and GA+FCM algorithm with Iris testing data and Wine testing data. The simulation result proves that compared with other algorithms, the new algorithm not only has the favorable convergence but also has been obviously improved the clustering effect.
On the hardness of minimizing space for all-shortest-path interval routing schemes
Authors: Rui Wang, Francis C. M. Lau, Yan Yan Liu
Venue: Theoretical Computer Science (2007)

k-Interval Routing Scheme (k-IRS) is a compact routing method that allows up to k interval labels to be assigned to an arc; and global k-IRS allows not more than a total of k interval labels in the whole network. A fundamental problem is to characterize the networks that admit k-IRS (or global k-IRS). Many of the problems related to single-shortest-path k-IRS have already been shown to be NP-complete. For all-shortest-path k-IRS, the characterization problem remains open for k>=1. In this paper, we study the time complexity of devising minimal-space all-shortest-path k-IRSs and show that it is NP-complete to decide whether a graph admits an all-shortest-path k-IRS, for every integer k>=3, and so is that of deciding whether a graph admits an all-shortest-path k-strict IRS, for every integer k>=4. These are the first NP-completeness results for all-shortest-path k-IRS where k is a constant and the graph is unweighted. The NP-completeness holds also for the linear case. We also prove that it is NP-complete to decide whether an unweighted graph admits an all-shortest-path IRS with global compactness of at most k, which also holds for the linear and strict cases.
An Image Interpolation Scheme Combined with Artificial Neural Network
Authors: Fengmei Liang, Keming Xie
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

Due to some inner and outer reasons of image system, images obtained by some sensors will be degraded unavoidably. The main purpose of this paper is to present an efficient image interpolation scheme to improve the resolution and quality of images. The scheme is realized by combining Bézier surface interpolation with an artificial neural network (ANN). Theoretically, the hybrid rapid algorithm has more advantages than other interpolation algorithm. Moreover, the algorithm has been demonstrated to improve efficiently the image resolution with example applications and their results.
COHESION - A microkernel based Desktop Grid platform for irregular task-parallel applications
Authors: Sven Schulz, Wolfgang Blochinger, Markus Held, Clemens Dangelmayr
Venue: Future Generation Computer Systems (2008)

We present Cohesion, a novel approach to Desktop Grid Computing. A major design goal of Cohesion is to enable advanced parallel programming models and application specific frameworks. We focus on methods for irregularly structured task-parallel problems, which require fully dynamic problem decomposition. Cohesion overcomes limitations of classical Desktop Grid platforms by employing peer-to-peer principles and a flexible system architecture based on a microkernel approach. Arbitrary modules can be dynamically loaded to replace default functionality, resulting in a platform that can easily adapt to application specific requirements. We discuss two representative example applications and report on the results of performance experiments that especially consider the high volatility of resources prevailing in a Desktop Grid.
Computer Society Connection
Authors: Bob Ward
Venue: Computer (2007)

Topics covered include the 2007 Eckert-Mauchly Award, editor in chief appointments, and Computer Society college scholarships.
Quantum network based on multiparty quantum secret sharing
Authors: Hongyang Ma, Bingquan Chen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In this paper we develop a quantum network with a mutual quantum secure direct communication scheme based on multiparty quantum secret sharing. This quantum network, assuming to contain clusters S, M, and D, shares a sequence of single photons and Greenberger-Horne-Zeilinger (GHZ) states. Each cluster is made of the same or similar quantum nodes gathered or occurring closely together. The feature of this scheme is that the communication between two clusters depends on the agreement of the third cluster. We also prove that such a quantum network is unconditionally secure.
Support vector fuzzy adaptive network in regression analysis
Authors: Judong Shen, Yu-Ru Syau, E. S. Lee
Venue: Computers Mathematics with Applications (2007)

Neural-fuzzy systems have been proved to be very useful and have been applied to modeling many humanistic problems. But these systems also have problems such as those of generalization, dimensionality, and convergence. Support vector machines, which are based on statistical learning theory and kernel transformation, are powerful modeling tools. However, they do not have the ability to represent and to aggregate vague and ill-defined information. In this paper, these two systems are combined. The resulting support vector fuzzy adaptive network (SVFAN) overcomes some of the difficulties of the neural-fuzzy system. To illustrate the proposed approach, a simple nonlinear function is estimated by first generating the training and testing data needed. The results show that the proposed network is a useful modeling tool.
Wescon 77
Authors: W. P. Riley
Venue: Computer (1977)

Peripheral circuitry is the basis upon which future technical advances in microcomputers will be made. This conclusion is backed up, at least in part, by the rapidly growing proportion of peripherals in the microcomputer market. 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
Algebra-based scalable overlay network monitoring: algorithms, evaluation, and applications
Authors: Yan Chen, David Bindel, Han Hee Song, Randy H. Katz
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay network with n end hosts, existing systems either require O(n2) measurements, and thus lack scalability, or can only estimate the latency but not congestion or failures. Our earlier extended abstract [Y. Chen, D. Bindel, and R. H. Katz, "Tomography-based overlay network monitoring," Proceedings of the ACM SIGCOMM Internet Measurement Conference (IMC), 2003] briefly proposes an algebraic approach that selectively monitors k linearly independent paths that can fully describe all the O(n2) paths. The loss rates and latency of these k paths can be used to estimate the loss rates and latency of all other paths. Our scheme only assumes knowledge of the underlying IP topology, with links dynamically varying between lossy and normal. In this paper, we improve, implement, and extensively evaluate such a monitoring system. We further make the following contributions: i) scalability analysis indicating that for reasonably large n (e.g., 100), the growth of k is bounded as O(n log n), ii) efficient adaptation algorithms for topology changes, such as the addition or removal of end hosts and routing changes, iii) measurement load balancing schemes, iv) topology measurement error handling, and v) design and implementation of an adaptive streaming media system as a representative application. Both simulation and Internet experiments demonstrate we obtain highly accurate path loss rate estimation while adapting to topology changes within seconds and handling topology errors.
Implementing middleware for content filtering and information flow control
Authors: Jeffrey Choi Robinson, W. Scott Harrison, Nadine Hanebutte, Paul Oman, Jim Alves-Foss
Venue: Proceedings of the 2007 ACM workshop on Computer security architecture (2007)

This paper discusses the design and implementation of a middleware guard for purposes of content filtering and information flow control in the Multiple Independent Levels of Security (MILS) architecture. The MILS initiative is a joint research effort between academia, industry, and government to develop and implement a high assurance real-time architecture for embedded systems. The MILS architecture incorporates a separation kernel with formal system security policies that are evaluatable, non-bypassable, tamper-proof, and always invoked. Vendor specific high-level applications are assumed to be untrustworthy components; information flow control needs to be performed by middleware entities external to the applications. In the MILS architecture, a MILS Message Router and guards are placed between communicating entities to act as message content filters and enforce information flow control. As the MILS architecture does not restrict the protocols that can be employed for communications between applications, a distinct guard is needed for filtering messages within each protocol. Incorporating protocol specific guards in MILS embedded systems aids in the formal certification of those systems or the high-assurance safety critical formally-proven applications. The guards enable formally-proven security policies that guarantee information flow control, data isolation, predictable process control, damage limitation, and resource availability. An example is provided using a multi-level secure file server that uses a GIOP guard for fine-grained access control. The inclusion of a GIOP guard reduces the complexity and the effort necessary for system certification.
A migration strategy of mobile agents for the transport network applications
Authors: Hayfa Zgaya, Slim Hammadi, Khaled Ghédira
Venue: Mathematics and Computers in Simulation (2008)

This paper presents a migration strategy for a set of mobile agents (MAs) in order to satisfy customers' requests in a transport network, through a multimodal information system. In this context, we propose an optimization solution which operates on two levels. The first one aims to constitute a set of MAs building their routes, called Workplans. At this stage, Workplans must incorporate all nodes, representing information providers in the multimodal network, in order to explore it completely. Thanks to an evolutionary approach, the second level must optimize nodes' selection in order to increase the number of satisfied users. The assignment of network nodes to the required services must be followed by a Workplan update procedure in order to deduce final routes paths. Finally, simulation results are mentioned to invoke the different steps of our adopted approach.
Design of fuzzy power system stabilizer using adaptive evolutionary algorithm
Authors: Gi-Hyun Hwang, Dong-Wan Kim, Jae-Hyun Lee, Young-Joo An
Venue: Engineering Applications of Artificial Intelligence (2008)

This paper presents a design of fuzzy power system stabilizer (FPSS) using an adaptive evolutionary algorithm (AEA). AEA consists of genetic algorithm (GA) for a global search capability and evolution strategy (ES) for a local search in an adaptive manner when the present generation evolves into the next generation. AEA is used to optimize the membership functions and scaling factors of FPSS. The propose method is applied to single-machine infinite bus system (SIBS) and multi-machine power system (MPS). Results of numerical experiment show that the control performance of the FPSS is better than that of a conventional power system stabilizer (CPSS) for three-phase fault in heavy load. To show the robustness of FPSS, it is applied with disturbances such as change of mechanical torque and three-phase fault in nominal and heavy load, etc. FPSS shows better robustness than CPSS.
A visualization testbed for analyzing the performance of computational linguistics algorithms
Authors: Stephen G. Eick, Justin Mauger, Alan Ratner
Venue: Information Visualization (2007)

We have built an AJAX-enabled browser-based testbed for evaluating the performance of computational linguistics algorithms. Our testbed consists of a visualization system and analysis portal. Our focus is on algorithms that classify and cluster documents by assigning weights to words and scoring each document against high-dimensional reference concept vectors. The testbed visualization and algorithm analysis techniques include Confusion Matrices, ROC Curves, Document Visualizations showing word importance, and Interactive Reports. A unique aspect of our testbed is document visualizations built using Scalable Vector Graphics that show why documents are assigned to particular concepts and categories.
Image Quality Assessment Using Rough Fuzzy Integrals
Authors: Wei Dong, Qian Yu, Chang N. Zhang, Hua Li
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops - Supplements (2007)

In this paper, a generalized image quality metric based on rough fuzzy integrals is presented. The proposed assessment is to evaluate the image quality by categorizing the pixels of the image into the edge region, texture region and flat region considering the different effects of each region on the image quality. The rough fuzzy integrals are employed into the block of pixels to assess effectively and efficiently the image quality. The experimental results illustrate that the proposed quality metric has an effective evaluation on the image quality.
Displays on Display
Venue: IEEE Computer Graphics and Applications (1981)

Fall River Pass Quadrangle, Colorado. This image is a terrain model of a 6.6 x 8.5-mile area in Rocky Mountain National Park, near Estes Park, Colorado. A digital contour-line map of the quadrangle was converted into a hierarchical quadtree structure of bicubic surface patches. The image displays 4088 patches with first derivative continuity at the quadtree level. The view of the terrain, which in the area of the model ranges from 9000 to 12,500 feet, is from the south-southwest. The sun is at the southeast at 30 degrees. The ratio of the vertical scale to the horizontal scales is 7:1: 1, and vertical elevation colors from green to brown are painted on the terrain. 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
DFM reality in sub-nanometer IC design
Authors: N. Verghese, P. Hurat
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The impact of sub-nanometer (below 90nm) effects on IC designs needs to be clearly understood to ensure that (1) manufacturing variations are considered during design to avoid catastrophic failures, and (2) the expected performance simulated in design is actually realized on silicon to avoid parametric failures. This paper discusses design for manufacturing solutions that enable designers to predict systematic manufacturing variations during design to detect and repair catastrophic and parametric failures. This paper presents real examples of design sensitivities to sub-nanometer manufacturing variations and the need to correctly analyze, optimize and verify the design before manufacturing by using appropriate EDA solutions which bring the effects of manufacturing variations in the design flow.
Development of e-learning resource for teacher education utilizing a VOD-compatible teaching portfolio
Authors: Hitoshi Miyata
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

We have developed a teaching improvement support system utilizing a web-based teaching portfolio provided with a VOD-compatible animated video clip function. This system has been used by active teachers since last year. This teaching portfolio has recently been given a dual-screen synchronous playback function for video clips of classes, and has been distributed as an e-learning resource to enable students to observe classes prior to practical teacher training. As a result, in comparison with video clips on a single screen, this dual-screen synchronous playback has been suggested as being effective as an instructional resource since there are differences in the manner in which students perceive the three points consisting of the sense of presence of classroom observation, understanding the reactions of students in response to questions from the instructor, and understanding the preferences and interests of students.
Block Marking and Updating Coding in Test Data Compression for SoC
Authors: Lei Zhang, Huaguo Liang, Wenfa Zhan, Cuiyun Jiang
Venue: Proceedings of the 16th Asian Test Symposium (2007)

A novel test data compression coding scheme, block marking and updating coding, is proposed in this paper. Test data in the test set was divided into successive fixed-length vectors, called blocks, and then they were marked according to their compatibility compared with a reference vector. An operation that is similar to difference and a technique that strategically fills in don't-care bits are combined to increase the probabilities of compatibility or inverse compatibility. It effectively compresses test data and its decompression structure is very simple. Experimental results of ISCAS-89 benchmark circuits show that the scheme is very effective.
Benchmarking Engineering Workstations
Authors: Mark Linton
Venue: IEEE Design Test (1986)

As workstations become more popular, it is increasingly important to be able to measure and compare their relative performance.However, benchmarks are often either too specific to be of general interest or too general to be relevant to a specific application.We have constructed a collection of benchmarks?for a common kind of engineering workstation?that give a good approximationof processor, graphics, file access, and multitasking performance while being small and simple enough to easily transport.We have run the benchmarks on a number of workstations, including Sun-3, Apollo 560, VAXstation-II, and IRIS 2400, with overallresults meeting our approximate expectations. Our approach allows us to quickly assess the performance of new workstations.
A Novel Multi-object Trade-Off Mechanism Model Based on Process Management in Software Project
Authors: Lina Yao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Aiming at practical requirements of present software project management and control, the paper presented to construct integrated multi-object trade-off model based on software project process management, so as to actualize integrated and dynamic trade-oil of the multi-object system of project. Based on analyzing basic principle of dynamic controlling and integrated multi-object trade-off system process, the paper integrated method of cybernetics and network technology, through monitoring on some critical reference points according to the control objects, emphatically discussed the integrated and dynamic multi- object trade-off model and corresponding rules and mechanism in order to realize integration of process management and trade-off of multi-object system.
Bayesian Statistics: Mathematical Tools for Computers*
Authors: D. E. Raeside
Venue: Computer (1975)

This tutorial article deals with a branch of statistics known as "Bayesian statistics." To better understand the underlying philosophy of Bayesian statistics, let us contrast its outlook with that of "classical statistics." 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
Percolation of Code to Enhance Parallel Dispatching and Execution
Authors: C. C. Foster
Venue: IEEE Transactions on Computers (1972)

This note investigates the increase in parallel execution rate as a function of the size of an instruction dispatch stack with lookahead hardware. Under the constraint that instructions are not dispatched until all preceding conditional branches are resolved, stack sizes as small as 2 or 4 achieve most of the parallelism that a hypothetically infinite stack would.