ppxscal/embedding_network huggingface dataset:
Comparing tagging vocabularies among four enterprise tag-based services
Authors: Michael J. Muller
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

We compare four tagging-based enterprise services, which respectively stored bookmarks to webpages and documents, to people, to blog entries, and to hierarchically-structured activity records. Analysis of user data and tag data showed relatively small overlaps in tags used. Conventional normalization strategies produced only modest improvement. These results suggest difficulties in combining exploratory searches across multiple social-tagging services. We recommend strategies for cross-service tag integration at the points of tag storage and tag search, rather than at the conventional point of tag entry. We close with a research agenda around this strategy.
Fast Predictive Search Algorithm for Video Motion Estimation
Authors: Lei-Chun Chou, Cheng-Da Ye, Yuan-Chen Liu, Bin-Cheng Jhao
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper, two faster algorithms- Fast Predictive Search Algorithm (FPSA) and Fast Predictive Search Algorithm-Early Termination (FPSA-ET), used in motion estimation were proposed. These algorithms are proceeded by the temporal and spatial correlation between BMA and the film and by the prediction of motor vectors. The video coding is generally following the order from top to down and left to right and it causes the spatial correlation between the adjacent blocks, especially for those blocks on the left and up sides. The motion of the object in the image would follow the constant trace, so there would be temporal correlation between the blocks. Based on the experimental data of this paper, the proposed algorithms are faster than the conventional one for about 20%~25% and faster than UMHexagonS for about 20 times. The PSNR value of the proposed algorithms are higher than the conventional one for 0.22dM~0.32dM. Therefore the proposed algorithms are more appropriate for the real-time or high quality video or for video with large amounts of motion.
Designing Effective Business Graphics
Authors: Raymond Gust
Venue: IEEE Computer Graphics and Applications (1983)

Creating effective presentation graphics doesn't have to be a difficult task, but you do need to plan ahead¿before your system starts cranking out slides 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
Context-Aware Middleware for Anytime, Anywhere Social Networks
Authors: Dario Bottazzi, Rebecca Montanari, Alessandra Toninelli
Venue: IEEE Intelligent Systems (2007)

Recent advances in wireless technologies and mobile devices let users form opportunistic social networks of interests with nearby users. However, anytime, anywhere social networks raise several technological issues, including the detection of user location; the modeling, acquisition, and analysis of a user's characterizing properties; and the dynamic extraction of social networks. SAMOA, a semantic context-aware middleware approach, lets you create anytime, anywhere social networks among users in physical proximity. SAMOA separates social-network management from application logic by providing reusable middleware support for various social application scenarios. In addition, SAMOA exploits semantic-based context modeling and matching algorithms for social-network extraction. This article is part of a special issue on social computing.
Transform domain texture synthesis
Authors: D. S. Wickramanayake, E. A. Edirisinghe, H. E. Bez
Venue: Image Communication (2008)

In this paper, we propose a fast DWT-based multi-resolution texture synthesis algorithm in which coefficient blocks of the spatio-frequency components of the input texture are efficiently stitched together to form the corresponding components of the synthesised output texture. We propose the use of an automatically generated threshold to determine the visually significant coefficients, which act as elements of a matching template used in the texture quilting process. We show that the use of a limited set of visually significant coefficients, regardless of their level of resolution, not only reduces the computational cost, but also results in more realistic texture synthesis. A transform domain texture blending strategy is used to remove the remaining artefacts across edges, improving the synthesised texture quality further. We use popular test textures to compare our results with that of the state-of-the-art techniques. Some application scenarios of the proposed algorithm are also discussed.
Improving the Integration of the Software Supply Chain via the Semantic Web
Authors: Roy Oberhauser, Rainer Schmidt
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Supply chains are a significant concept for improving the cooperation of vendors and customers for material products. While the assembly of increasingly complex components in modern software development resembles a supply chain, classical supply chain management concepts are rarely applied. An interruption in the flow of information exists between the development/maintenance phases and operational phases, resulting in ignorance, inefficiencies, and suboptimal quality and support levels. One reason for this is the effort necessary to integrate the software lifecycle processes, coupled with the dispersion of information needed for execution of (semi-)automated software lifecycle workflows across semantically heterogeneous sources. Furthermore, the manual derivation of abstract IT (e.g., ITIL) and software processes into concrete processes and workflows results in low quality and inefficiencies. This paper describes an approach for improving the integration of software supply chains via the (semi- )automated realization of abstract software lifecycle processes and workflows in conjunction with Semantic Web technologies.
A New Method of the Automatically Marked Chinese Part of Speech Based on Gaussian Prior Smoothing Maximum Entropy Model
Authors: Wei Zhao, Faxing Zhao, Wenhui Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

With its many virtues, maximum entropy (ME) model has been favored in natural language processing. Because of the limitation of the training data, the parameters sparse phenomenon is serious in Chinese part of speech. The model is prone to over fit training data, therefore some smoothing method should be applied on maximum entropy model. While several smoothing methods for maximum entropy models have been proposed to address this problem, Gaussian prior smoothing method has an outstanding performance. Based on this smoothing maximum entropy model and characteristics of Chinese, a new Chinese partofspeech system is presented. Result of experiment shows that it works well.
XML Retrieval: DB/IR in theory, web in practice
Authors: Sihem Amer-Yahia, Ricardo Baeza-Yates, Mariano P. Consens, Mounia Lalmas
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

The world of data has been developed from two main points of view: the structured relational data model and the unstructured text model. The two distinct cultures of databases and information retrieval now have a natural meeting place in the Web with its semi-structured XML model. Data in Digital Libraries and in Enterprise Environments also shares many of the semi-structured characteristics of web data. As web-style searching becomes an ubiquitous tool, the need for integrating these two viewpoints becomes even more important. In particular, we consider the application of DB and IR research to querying Web data in the context of online communities. With Web 2.0, the question arises: how can search interfaces remain simple when users are allowed to contribute content (Wikipedia), share it (Flickr), and rate it (YouTube)? When they can decide who their friends are (del.icio.us), what they like to see, and how they want it to look like (MySpace)? While we want to keep the user interface simple (keyword search), we would like to study the applicability of querying structure and content to a context where new forms of data-driven dynamic web content (e.g. user feed-back, tags, contributed multimedia) are provided. This tutorial will provide an overview of the different issues and approaches put forward by the IR and DB communities and survey the DB-IR integration efforts as they focus in the problem of retrieval from XML content. In particular, the context of querying content in online communities is an excellent example of such an application. Both earlier proposals as well as recent ones will be discussed. A variety of application scenarios for XML Retrieval will be covered, including examples of current tools and techniques.
Research and Design of Personalized Recommendation System Based on J2ME
Authors: Chen Bing
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Advances in Internet and network technology and the rapidly growing number of mobile personal devices result in the fast growth of Mobile E-Service, M-Commerce and E-Learning. A personalized recommendation system based on J2ME was proposed and realized in the paper. The structure of system, realization process and key technologies of J2ME system structure, XML analysis, Data transmission between mobile terminal and Web server were introduced in the paper. XML language was the middleware to realize data exchange and processing for isomerism system. HTTP protocol was used to communicate between Internet website and mobile terminal. The system was also used by some customers. The application results of the system manifested that the system could support E-commerce better.
IEEE Computer Society Election
Venue: Computer (2007)

Nominees for IEEE Computer Society offices and the Board of Governors offer position statements supporting their candidacy for elected office beginning 1 January 2008.
Sensor Network Connectivity and Security Analysis Using a Single Per-node Random Key
Authors: Jason Barbour, Mohamed Younis
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Wireless sensor networks comprise individual sensor nodes with limited storage and computational power. These restrictions can cause difficulty when establishing secure communication links between nodes. Expensive encryption schemes, such as Diffie-Hellman key exchange, simply cannot be effectively implemented. As a consequence, alternative methods are necessary to provide adequate security. One such technique involves randomly distributing several encryption keys and then requiring nodes to discover neighbors that share a subset of these assigned keys. Once compatible neighbors are located, communication is secured through the use of symmetric encryption. Though the requirements for this scheme are less than complex asymmetrical algorithms, each sensor node is still required to store several keys and node-to-key associations. In this paper, we advocate a simplistic approach that reduces key storage while limiting a network's susceptibility to being compromised. The approach is based on assigning a single randomly-selected key to each node. The paper presents a detailed analysis of the resilience of the proposed scheme to the collusion attacks and studies the implications on the network connectivity.
Computer Architectures for Pictorial Information Systems
Authors: P. -E. Danielsson
Venue: Computer (1981)

In the international search for the optimal image processing computer architecture, image parallelism is the key to cost effectiveness.
An Improved Identity-based Fault-tolerant Conference Key Distribution Scheme
Authors: Yongquan Cai, Xiuying Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Fault-tolerance is an important property of conference key distribution protocol. Recently, Yang et al. proposed an identity-based fault-tolerant conference key distribution scheme which is much different to the traditional ones. But their scheme can not withstand passive attack and modification attack, moreover, it also can not provide forward security. An improved identity-based fault-tolerant conference key distribution scheme is proposed in this paper. Compared with the Yang et al.'s scheme, Tzeng's[1] scheme and Xun's scheme, the new scheme has illustrated the highest security and its communication cost is intervenient Yang et al.'s scheme and Tzeng's[1] scheme. As security is the first-line property in conference key establishment protocol, our scheme is the most practical one in the mass.
Reducing the Impact of DoS Attacks on Endpoint IP Security
Authors: Joseph Touch, Yi-hua Yang
Venue: Proceedings of the 2006 2nd IEEE Workshop on Secure Network Protocols (2006)

IP security is designed to protect hosts from attack, but can itself provide a way to overwhelm the resources of a host. One such denial of service (DoS) attack involves sending incorrectly signed packets to a host, which then consumes substantial CPU resources to reject unwanted traffic. This paper examines the impact of such attacks, and provides a preliminary exploration of ways to reduce their impact. Measurements of the impact of DoS attack traffic on x86-based hosts in FreeBSD indicate that a single DoS attacker can reduce throughput by half. This impact can be reduced to approximately 20% by layering low-effort nonce validation on IPsec's more CPU-intensive cryptographic algorithms, but the choice of algorithm does not have as large an effect. This work suggests that effective DoS resistance requires an hierarchical defense using both nonces and strong cryptography at the endpoints.
Example of a Potential Grid technology Application in Shipbuilding
Authors: Alexander V. Bogdanov, Alexander Degtyarev, Elena N. Stankova
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

The paper is dedicated to the potential application of the Grid technology for the modeling of spatialtemporal wave and wind field characteristics (wave climate modeling). With reference to shipbuilding wave climate knowledge is necessary while ship and engineering offshore construction development and operation. Software complex for wave climate calculations represents a set of physical- mathematical models, describing wave and wind frequencydirectional spectra, including input meteorological data pre-processing and post-processing of the output data. The technology of the distributed calculations, Grid technology, will provide simulation of the complex problems using remote heterogeneous computational resources, with the simultaneous visualization of the large volumes of the scientific data. Distributed data processing and analyses will provide interconnection of the scientific tools with remote computers and data bases.
Online Experiments: Lessons Learned
Authors: Ron Kohavi, Roger Longbotham
Venue: Computer (2007)

Web experiments generate insights and promote innovation.
Empirical investigation of multiparent recombination operators in evolution strategies
Authors: Agoston E. Eiben, Thomas Bäck
Venue: Evolutionary Computation (1997)

An extension of evolution strategies to multiparent recombination involving a variable number ρ of parents to create an offspring individual is proposed. The extension is experimentally evaluated on a test suite of functions differing in their modality and separability and the regular/irregular arrangement of their local optima. Multiparent diagonal crossover and uniform scanning crossover and a multiparent version of intermediary recombination are considered in the experiments. The performance of the algorithm is observed to depend on the particular combination of recombination operator and objective function. In most of the cases a significant increase in performance is observed as the number of parents increases. However, there might also be no significant impact of recombination at all, and for one of the unimodal objective functions, the performance is observed to deteriorate over the course of evolution for certain choices of the recombination operator and the number of parents. Additional experiments with a skewed initialization of the population clarify that intermediary recombination does not cause a search bias toward the origin of the coordinate system in the case of domains of variables that are symmetric around zero.
High-Performance Distributed Video Content Analysis with Parallel-Horus
Authors: Frank J. Seinstra, Jan-Mark Geusebroek, Dennis Koelma, Cees G. M. Snoek, Marcel Worring, Arnold W. M. Smeulders
Venue: IEEE MultiMedia (2007)

As the world uses more digital video that requires greater storage space, Grid computing is becoming indispensable for urgent problems in multimedia content analysis. Parallel-Horus, a support tool for applications in multimedia Grid computing, lets users implement multimedia applications as sequential programs for efficient execution on clusters and Grids, based on wide-area multimedia services.
B70-1 Truth Functions and the Problem of Their Realization by Two-Terminal Graphs
Authors: M. A. Harrison
Venue: IEEE Transactions on Computers (1970)

This book consists of two parts, the first being a survey of the mathematical theory of Boolean functions. Chapter 1 introduces basic definitions, various normal forms, prime implicants, and symmetric functions. In an appendix to Chapter 1, an unpublished combinatorial and nontrivial theorem of Bakos is given. (This theorem yields a uniform construction of Gray codes as a consequence.) Chapter 2 gives the standard theory of minimality. Applications to special cases such as monotonic or symmetric functions are given. Chapter 3 discusses interrelationships between conjunctive and disjunctive normal forms. Chapter 4 deals with functional completeness and the Post-Yablonsky theorem is proven. Some applications to finite automata are given. Chapter 5 is concerned with the decomposition of truth functions. Chapter 6, on numerical problems, is particularly good. Groups are used to classify truth functions. A form of Pólya's theorem is given and the work of Pólya, Slepian, and the reviewer is presented. A number of special cases are worked out, including some of the results of Povarov. Chapter 7, on linearly separable functions, gives a number of characterizations. 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
Communication Networks for Interoperability and Reliable Service in Substation Automation System
Authors: Hyo-Sik Yang, Hyun-Soo Jang, Yong-Won Kim, Un-Sig Song, Sang-Sig Kim, Byung-Tae Jang, Byung-Seok Park
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

The IEC 61850 presents the international standard for communication networks and systems in substations. The standard discusses the detail of the requirements and the architecture of substation automation system as well as data type and format. The IEC 61850 will substitute the traditional hardwired analog communication network using upto- date communication protocols for interoperability and reliable service. Basically all IEDs are connected through TCP/UDP and IP over Ethernet based LAN to exchange data. Thanks to the Ethernet frame, we can deploy any type of advanced communication technology for communication in substation. This paper discusses the technical issues associated with the communication networks integration in detail. We consider the possible topologies in Ethernet architecture with the topic in the discussion of the pros and cons of their architecture, and the required functionality of each network elements in detail. Several data types, e.g., GOOSE, time synchronization, and FTP, which uses different protocol stack, are used in substation system with their own delay requirements. Communication profiles for these services are discussed in this paper. We also present the system configuration, requirements, and architecture of the system. We establish a guideline to build a communication networks in substation automation system based on IEC 61850 and presents the ad-hoc based architecture for survivable substation automation system.
Vibrotactile feedback for brain-computer interface operation
Authors: Febo Cincotti, Laura Kauhanen, Fabio Aloise, Tapio Palomäki, Nicholas Caporusso, Pasi Jylänki, Donatella Mattia, Fabio Babiloni, Gerolf Vanacker, Marnix Nuttin, Maria Grazia Marciani, José del R. Millán
Venue: Computational Intelligence and Neuroscience (2007)

To be correctly mastered, brain-computer interfaces (BCIs) need an uninterrupted flow of feedback to the user. This feedback is usually delivered through the visual channel. Our aim was to explore the benefits of vibrotactile feedback during users' training and control of EEG-based BCI applications. A protocol for delivering vibrotactile feedback, including specific hardware and software arrangements, was specified. In three studies with 33 subjects (including 3 with spinal cord injury), we compared vibrotactile and visual feedback, addressing: (I) the feasibility of subjects' training to master their EEG rhythms using tactile feedback; (II) the compatibility of this form of feedback in presence of a visual distracter; (III) the performance in presence of a complex visual task on the same (visual) or different (tactile) sensory channel. The stimulation protocol we developed supports a general usage of the tactors; preliminary experimentations. All studies indicated that the vibrotactile channel can function as a valuable feedback modality with reliability comparable to the classical visual feedback. Advantages of using a vibrotactile feedback emerged when the visual channel was highly loaded by a complex task. In all experiments, vibrotactile feedback felt, after some training, more natural for both controls and SCI users.
Optimal replenishment policy for perishable seasonal products in a season with ramp-type time dependent demand
Authors: S. Panda, S. Senapati, M. Basu
Venue: Computers and Industrial Engineering (2008)

A single item order level inventory model for a seasonal product is discussed where the demand rate is represented by a ramp-type time dependent function. A constant fraction of on hand inventory deteriorates per unit time. Shortages are not allowed. The model is developed over a finite time horizon (time period of a season) to determine optimal replenishment policy by minimizing total system running cost of entire season. An algorithm is provided to find the solution of the problem. A numerical example is presented and sensitivity analysis of the model is carried out. The rationale for time dependent ramp-type demand is also discussed.
A knowledge-based approach to adversarial decision making: Research Articles
Authors: Ronald R. Yager
Venue: International Journal of Intelligent Systems (2008)

Our focus here is to provide a methodology that can be used by a participant in an adversarial decision-making environment to help choose their action. Central to our approach is the use of knowledge and perceptions about one's adversary to obtain an uncertainty profile indicating which action the adversary will take. Once having this uncertainty profile, the problem of deciding which action to take becomes a problem of decision making under uncertainty. Here, we make considerable use of the Dempster--Shafer belief structure as a way of formalizing the uncertainties. &copy; 2008 Wiley Periodicals, Inc.