ppxscal/embedding_network huggingface dataset:
Cemeteries, oak trees, and black and white cows: learning to participate on the internet
Authors: Vicki L. O'Day, Mizuko Ito, Charlotte Linde, Annette Adler, Elizabeth D. Mynatt
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

Designers of Internet applications and those helping others learn about the net need to understand the problems Internet newcomers face as they encounter the idiosyncratic structures that organize the networked world. As part of an ethnographic study of SeniorNet, an organization that helps seniors learn to use computers, we explore early encounters with the networked world by analyzing questions asked in introductory computer classes. These questions, grounded in newcomers' prior experience, show how the taken-for-granted assumptions and strategies underlying successful Internet use differ from those in other domains. The questions and analysis are grouped in the following categories: identity on the Internet; boundaries and scope of the Internet; boundaries and scope of the personal computer; and organizations and providers in the networked world.
Neural Correlates of the Left-Visual-Field Superiority in Face Perception Appear at Multiple Stages of Face Processing
Authors: Galit Yovel, Jerre Levy, Marcia Grabowecky, Ken A. Paller
Venue: Journal of Cognitive Neuroscience (2003)

Studies in healthy individuals and split-brain patients have shown that the representation of facial information from the left visual field (LVF) is better than the representation of facial information from the right visual field (RVF). To investigate the neurophysiological basis of this LVF superiority in face perception, we recorded event-related potentials (ERPs) to centrally presented face stimuli in which relevant facial information is present bilaterally (B faces) or only in the left (L faces) or the right (R faces) visual field. Behavioral findings showed best performance for B faces and, in line with the LVF superiority, better performance for L than R faces. Evoked potentials to B, L, and R faces at 100- to 150-msec poststimulus showed no evidence of asymmetric transfer of information between the hemispheres at early stages of visual processing, suggesting that this factor is not responsible for the LVF superiority. Neural correlates of the LVF superiority, however, were manifested in a shorter latency of the face-specific N170 component to L than R faces and in a larger amplitude to L than R faces at 220-280 and 400-600 msec over both hemispheres. These ERP amplitude differences between L and R faces covaried across subjects with the extent to which the face-specific N170 component was larger over the right than the left hemisphere. We conclude that the two hemispheres exchange information symmetrically at early stages of face processing and together generate a shared facial representation, which is better when facial information is directly presented to the right hemisphere (RH; L faces) than to the left hemisphere (LH; R faces) and best when both hemispheres receive facial information (B faces).
Permuting machines and priority queues
Authors: R. E. L. Aldred, M. D. Atkinson, H. P. van Ditmarsch, C. C. Handley, D. A. Holton, D. J. McCaughan
Venue: Theoretical Computer Science (2005)

Machines whose sole function is to re-order their input data are considered. Every such machine defines a set of allowable input-output pairs of permutations. These sets are studied in terms of the minimal disallowed pairs (the basis). Some allowable sets with small bases are considered including the one defined by a priority queue machine. For more complex machines defined by two or more priority queues in series or parallel, the basis is proved to be infinite.
The Approximate Shortest Distance Route Intelligent System For Traveling in Taiwan
Authors: Chin-Jung Huang, Ying-Hong Lin
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

In a well known problem, there are N! possible routes for tourists to visit N cities, with each city passed through once before the return to the departure city. It is difficult to find the shortest route among N! possible routes quickly and effectively. This research proposes a method that integrates the Hungarian Method and the Branch-and-Bound Method in Operation Research, Nearest Neighbor in Data Mining, and Rule Based Inference in Artificial Intelligence to find the approximately shortest distance route and the distance. It also uses object-oriented programming to construct the Approximate Shortest Distance Route Intelligent System for Traveling (ASDRST). The ASDRST needs only a personal computer and it can find the approximate shortest distance route and corresponding distance quickly and effectively compared with other systems. Its accuracy is more than 99.8% in a pass-through of 42 cities.
Internet Home Network Electrical Appliance Control on the Internet with the UPnP Expansion
Authors: Kuk-Se Kim, Chanmo Park, Joon Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

Electrical appliances of home network via the Internet can be controlled with the UPnP expansion like ones in the same home network without modification of existing UPnP. In this paper, we propose Internet Gateway that consists of UPnP IGD(Internet Gateway Device) DCP(Device Control Protocol) and the UPnP Bridge for control electrical appliance of Internet home network. UPnP IGD DCP is configurable initiation and sharing of Internet connections, advanced connection-management, management of host configuration, and supports transparent Internet access by non-UPnP-certified devices. UPnP Bridge searches for local home network devices by sending control messages. Control Point of UPnP Bridge searches for devices of interest on the Internet and can deliver the control devices on other home networks to device within its home network.With our approach, devices can control home electrical appliances via internet through IGD DCP on other home network with control commands of UPnP.
Recognition of Composite Human Activities through Context-Free Grammar Based Representation
Authors: M. S. Ryoo, J. K. Aggarwal
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

This paper describes a general methodology for automated recognition of complex human activities. The methodology uses a context-free grammar (CFG) based representation scheme to represent composite actions and interactions. The CFG-based representation enables us to formally define complex human activities based on simple actions or movements. Human activities are classified into three categories: atomic action, composite action, and interaction. Our system is not only able to represent complex human activities formally, but also able to recognize represented actions and interactions with high accuracy. Image sequences are processed to extract poses and gestures. Based on gestures, the system detects actions and interactions occurring in a sequence of image frames. Our results show that the system is able to represent composite actions and interactions naturally. The system was tested to represent and recognize eight types of interactions: approach, depart, point, shake-hands, hug, punch, kick, and push. The experiments show that the system can recognize sequences of represented composite actions and interactions with a high recognition rate.
SemreX: Towards Large-Scale Literature Information Retrieval and Browsing with Semantic Association
Authors: Xiaomin Ning, Hai Jin, Hao Wu
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Access to scientific literature information is a very important, as well as time-consuming daily work for scientific researchers. Current methods of retrieval are usually limited to keyword-based searching using information retrieval techniques. In this paper, we present SemreX which implements efficient large-scale literature retrieval and browsing with a single access point based on semantic web technologies. The concept of Semantic Association is proposed to reveal explicit or implicit relationships between semantic entities, combining with the ontology-based information visualization technique so as to facilitate researchers retrieving semantically relevant information, as well as context relationships which can capture user's current search intentions while preserving an overall picture of scientific knowledge.
Optimization techniques for enhancing middleware quality of service for software product-line architectures
Authors: Douglas C. Schmidt
Venue:  (2005)

Product-line architectures (PLA)s are an emerging paradigm for developing software families by customizing reusable artifacts, rather than hand-crafting the software from scratch. In this paradigm, each product variant is assembled, configured, and deployed based on specifications of the required features and service-level agreements. To reduce the effort of developing software PLAs and product variants, it is common to leverage general-purpose---ideally standard---middleware platforms. These middleware platforms provide reusable services and mechanisms (such as connection management, data transfer protocols, concurrency control, demultiplexing, marshaling/demarshaling, and error-handling) that support a broad range of application requirements (such as efficiency, predictability, and minimizing end-to-end latency). A key challenge faced by developers of software PLAs is how to optimize standards-based---and thus largely application-independent---middleware to support the application-specific quality of service (QoS) needs of different product variants created atop a PLA. This dissertation provides four contributions to research on optimizing middleware for PLAs. First, it describes the evolution of optimization techniques for enhancing application-independent middleware to support the application-specific QoS needs of PLAs. Second, it presents a taxonomy that categorizes the evolution of this research in terms of (1) applicability, i.e., are the optimizations applicable across variants or specific to a variant, and (2) binding time, i.e., when are the optimizations applied during the middleware development lifecycle. Third, this taxonomy is applied to identify key challenges that have not been resolved by current research on PLAs, including reducing the complexity of subsetting, configuring, and specializing middleware for PLAs to satisfy the QoS requirements of product variants. Finally, the dissertation describes the OPTEML solution approach that synergistically addresses key unresolved research challenges via optimization strategies that encompass pattern-oriented, model-driven development, and specialization techniques to enhance the QoS and flexibility of middleware for PLAs. These optimizations have been prototyped, integrated, and validated in the context of several representative applications using middleware developed with Real-time Java and C++.
Data warehouse processing and query by mail
Authors: Ken Gordon
Venue: ACM SIGAPL APL Quote Quad (1996)

Much effort in I/S is currently going into creating "Data Warehouses." These are stores of data periodically extracted from older legacy applications, converted to common standards and made accessible for user analysis. The warehouse acts as a WORM (Write Once, Read Many times) storage. Where the extract and transfer is performed nightly, they provide access to what is termed "Near Operational" data and can be used to replace much of the existing reporting. In other cases they are used to store mostly historical data for analysis of trends, market impact, financial status and do on. While often implemented with a variety of different clean up tools, languages, data base products and query tools, this article describes an implementation done almost entirely with APL. It includes a query capability termed "Query by Mail" which enables anyone with access to E-Mail to send queries to the Warehouse and receive responses or extracts of data by return mail. The "query" includes customized analysis of field content to allow identification of fields and records containing invalid data. Built upon a proprietary inverted file system, it provides rapid response to user queries and little load on the server system. 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
Quantization Index Modulation Using Vector Quantization with DWT Based State-Codebook Search
Authors: Chin-Chen Chang, Yung-Chen Chou
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Data hiding is a serious topic for secret deliveries of confidential data through an unreliable computer network. Image is a useful media for covering secret data to achieve the purpose of delivering confidential data covertly. The techniques in the compression domain not only effectively reduce the size of image but also embed the confidential data into the compressed data. DWT based state-codebook search algorithm for vector quantization has better compression performance than side-match vector quantization for images with complex contents. The proposed method utilizes DWT based state-codebook search algorithm to reduce the size of image and embedding the secret data into the compressed image. In our design, unauthorized users cannot to know the secret data from stego-image without the decryption key. The experiment results showed that the proposed method successful embedded the secret data and maintained the visual quality of stego-image.
Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks
Authors: Haiying Shen, Cheng-Zhong Xu
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of network nodes and the non-uniform and timevarying file popularity. Existing DHT load balancing algorithms are mainly focused on the issues caused by node heterogeneity. To deal with skewed lookups, this paper presents an elastic routing table (ERT) mechanism for query load balancing, based on the observation that high degree nodes tend to experience more traffic load. The mechanism allows each node to have a routing table of variable size corresponding to its capacity. The indegree and outdegree of the routing table can also be adjusted dynamically in response to the change of file popularity and network churn. Theoretical analysis proves the routing table degree is bounded. The ERT mechanism facilitates locality-aware randomized query forwarding to further improve lookup efficiency. By relating query forwarding to a supermarket customer service model, we prove a 2-way randomized query forwarding policy leads to an exponential improvement in query processing time over random walking. Simulation results demonstrate the effectiveness of the ERT mechanism and its related query forwarding policy for congestion and query load balancing. In comparison with the existing "virtual-server"-based load balancing algorithm and other routing table control approaches, the ERT-based congestion control protocol yields significant improvements in query lookup efficiency.
Gabor Filter Based Text Extraction from Digital Document Images
Authors: Yu-Long Qiao, Meng Li, Zhe-Ming Lu, Sheng-He Sun
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

The automatic text detection in document images is useful for many applications. This paper presents an algorithm that can automatically detect and extract text in digital document images. Firstly, we process and fuse Gabor filtered images at different orientations and scales and obtain an image that reflects the layout of the document image. Then, potential text regions are directly extracted from the resulting image. Finally, two criteria based on the geometrical property and high frequency content are adopted to kick-out those non-text regions. The experiments are performed on some representative images with different styles and with texts in different languages and fonts. Experimental results show that the algorithm works well on document images from a wide variety of source.
Partial digest is hard to solve for erroneous input data
Authors: Mark Cieliebak, Stephan Eidenbenz, Paolo Penna
Venue: Theoretical Computer Science (2005)

The Partial Digest problem asks for the coordinates of m points on a line such that the pairwise distances of the points form a given multiset of (m 2) distances. Partial Digest is a well-studied problem with important applications in physical mapping of DNA molecules. Its computational complexity status is open. Input data for Partial Digest from real-life experiments are always prone to error, which suggests to study variations of Partial Digest that take this fact into account. In this paper, we study the computational complexity of Partial Digest variants that model three different error types that can occur in the data: additional distances, missing distances, and erroneous fragment lengths. We show that these variations are NP-hard, hard to approximate, and strongly NP-hard, respectively.
Interleaving of Delay Fault Tes Data for Efficient Test Compression with Statistical Coding
Authors: Kazuteru Namba, Hideo Ito
Venue: Proceedings of the 15th Asian Test Symposium (2006)

This paper proposes a method providing eflcient test compression for delay fault testing using enhanced scan design. In the proposed method, the initial and transition vectors of test data are interleaved before test compression using statistical coding. This paper also shows test architecture for delay fault testing using the proposed method. The proposed method is experimentally evaluated from the viewpoint of compression rates. For robust testable path delay fault testing on 11 out of 29 ISCAS89 benchmark circuits, the combination of Huffman coding and the proposed method provides higher compressaon rates than Huffrnan coding without the proposed method, run-length coding, Golomb coding, frequency-directed run-length (FDR) coding and variable-length input Hugman coding (VIHC),
Frontal and Parietal Components of a Cerebral Network Mediating Voluntary Attention to Novel Events
Authors: K. R. Daffner, L. F. M. Scinto, A. M. Weitzman, R. Faust, D. M. Rentz, A. E. Budson, P. J. Holcomb
Venue: Journal of Cognitive Neuroscience (2003)

Despite the important role that attending to novel events plays in human behavior, there is limited information about the neuroanatomical underpinnings of this vital activity. This study investigated the relative contributions of the frontal and posterior parietal lobes to the differential processing of novel and target stimuli under an experimental condition in which subjects actively directed attention to novel events. Event-related potentials were recorded from well-matched frontal patients, parietal patients, and non-brain-injured subjects who controlled their viewing duration (by button press) of line drawings that included a frequent, repetitive background stimulus, an infrequent target stimulus, and infrequent, novel visual stimuli. Subjects also responded to target stimuli by pressing a foot pedal. Damage to the frontal cortex resulted in a much greater disruption of response to novel stimuli than to designated targets. Frontal patients exhibited a widely distributed, profound reduction of the novelty P3 response and a marked diminution of the viewing duration of novel events. In contrast, damage to posterior parietal lobes was associated with a substantial reduction of both target P3 and novelty P3 amplitude; however, there was less disruption of the processing of novel than of target stimuli. We conclude that two nodes of the neuroanatomical network for responding to and processing novelty are the prefrontal and posterior parietal regions, which participate in the voluntary allocation of attention to novel events. Injury to this network is indexed by reduced novelty P3 amplitude, which is tightly associated with diminished attention to novel stimuli. The prefrontal cortex may serve as the central node in determining the allocation of attentional resources to novel events, whereas the posterior parietal lobe may provide the neural substrate for the dynamic process of updating one's internal model of the environment to take into account a novel event.
D-Grid, an E-Science Framework for German Scientists
Authors: Wolfgang Gentzsch
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

The World Wide Web has become pervasive in many facets of our professional and personal lives during the past 10 years. Today, another Internet revolution is emerging: Grid Computing. While the Web offers easy access to mostly static information via Hypertext, the Grid adds another fundamental layer by enabling access to and use of the underlying resources. Based on widely accepted grid and web services standards, resources including computers, storage, scientific instruments and experiments, applications, data, and middleware services communicate with each other and deliver results back to the user. These resources are part of a single service-oriented architecture, called OGSA, the Open Grid Services Architecture. For the past several years, early adopters in research and industry have been building and operating prototypes of grids for global communities, virtual organizations, and within enterprises..
Autonomic network management: some pragmatic considerations
Authors: Richard Mortier, Emre Kiciman
Venue: Proceedings of the 2006 SIGCOMM workshop on Internet network management (2006)

Autonomic Network Management (ANM) has the goal of increasing reliability and performance while reducing management cost using various automated techniques. These range from agent-based approaches relying on explicit models and ontologies to emergent techniques relying on gossip protocols, swarming algorithms or other biologically inspired work. In this paper, we review the failures, growing pains and successes of earlier techniques for automated and adaptive network control and management, from the simple control loops in TCP and OSPF to the more complicated emergent behaviors of BGP dynamics and overlay routing. From these examples we extract several lessons relevant to ongoing research in autonomic network management.
I/O Scheduling in Huge Object-based Storage System
Authors: Dan Feng, Hanbo Liu
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

Huge Object-based Storage System (HOSS), using objects which possess their own attributes and methods as storage interface, absorbs the advantages of both blocks and files interface. HOSS adopts the interaction among clients, metadata servers and object-based storage device, which has decreased the overload of servers in large measure.After the interactions' flows concerned with I/O operations among the three components described in detail, the design and implementation of parallel I/O scheduling is described and discussed. With the buffer, the results show that it enhances the whole system performance efficiently. The performance is better when it's compared with the Lustre system.