ppxscal/embedding_network huggingface dataset:
Addressing class distribution issues of the drawing vs writing classification in an ink stroke sequence
Authors: Xin Wang, Manoj Biswas, Sashi Raghupathy
Venue: Proceedings of the 4th Eurographics workshop on Sketch-based interfaces and modeling (2007)

Complicated by temporal correlations among the strokes and varying distributions of the underlying classes, the drawing/writing classification of ink strokes in a digital ink file poses interesting challenges. In this paper, we present our efforts in addressing some of the issues. First, we describe how we adjust the outputs of the neural network to a priori probabilities of new observations to produce more accurate estimates of the posterior probabilities. Second, we describe how to adapt the parameters of the HMM to new data sets. Albeit the fact that the emission probabilities of the HMM are computed indirectly from the outputs of the neural network, our modified Baum-Welch algorithm still finds the correct estimates for the HMM's parameters. We also present experimental results of our new algorithms on 6 real-world data sets. The results show that our methods increase the F-Measures of both the drawing and the writing classes on the more "drawing-intensive" data sets which have stronger temporal correlations. But they do not perform well on the more "writing-intensive" data sets.
Survey of Energy Efficient Strategies in Wireless Ad Hoc and Sensor Networks
Authors: Saoucene Mahfoudh, Pascale Minet
Venue: Proceedings of the Seventh International Conference on Networking (2008)

The diversity of the applications supported by wireless ad hoc and sensor networks explain the success of these networks. However, their energy constrained nature requires the use of energy efficient strategies to maximize network lifetime. We can classify these strategies in four categories: 1. Energy efficient routing, 2. Scheduling the nodes sleeping state, 3. Topology control by tuning node transmission power and 4. Reducing the volume of information transferred. For each category, a state of the art is given and new protocols are presented. The best energy efficiency will be obtained by combining all the four categories of strategies. A cross-layering approach is a promising tradeoff between generic solutions and solutions optimized for a specific application.
Hybrid Negotiation Mechanism for Resolution Conflicts between Replicas in Data Grid
Authors: Ghalem Belalem, Belabbes Yagoubi
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Large scale systems such as computational Grid are distributed computing infrastructure that can provide globally available network resources. Grid computing has emerged as a framework for supporting complex compilations over large data sets. In general, grids enable the efficient sharing and management of computing resources for the purpose of performing large complex tasks. In particular, grids have been defined as anything from batch schedulers to peer-to-peer platforms. To be able to sharing data, it is recommended to use the replication technique, it makes data accessible by user who is kept transparent to node and network crashes and communication failure since the user data is redundantly available on more than one site. The replication management and their implementation is not a simple task and produces many additional problems, like replicas consistency problem. One of the concerns major in the consistency management approaches called optimistic, it is the conflicts resolution between replicas. In this paper we present an hybrid negotiation mechanism based on the various negotiation forms between virtual consistency agents to be able to critical situation for sites and to reduce the number of conflicts between replicas to converge them more quickly in data grids.
Coordination Behavioral Structure: A Web Services Coordination Model in Dynamic Environment
Authors: Yongwang Zhao, Dianfu Ma, Min Liu, Chunyang Hu
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

The ability to describe the coordinative behavior of interacting web services is key aspect in the development of next generation internet software systems. In this paper, a layered architecture for coordination system is introduced. Based on coordination structure that presents the basic architecture of coordination system, we propose a web services coordination model, Coordination Behavioral Structure (CBS), which formalize the services interactions and their relationships. CBS expresses the coordinative behaviors of a coordination structure. CBS graph constructed by relationships of interactions using basic and extended compositors is proposed for visual description of coordination behaviors. For illustrating CBS, an example and CBS of basic coordination structures are presented.
An efficient MAC protocol for cooperative diversity in mobile ad hoc networks
Authors: Md. Rajibul Islam, Walaa Hamouda
Venue: Wireless Communications Mobile Computing (2008)

Cooperative diversity is proposed to combat the detrimental effects of channel fading. In this paper, we investigate the effectiveness of cooperative diversity in interference limited ad hoc networks. The negative effects due to relay blocking on the network throughput are investigated. We show that the relay blocking problem is mainly dependent on the relay selection criterion. To overcome this problem, we propose a new cooperative diversity technique based on a modified IEEE 802.11 Medium Access Control (MAC) protocol. The throughput performance of the proposed MAC protocol is analyzed using a random structured network where nodes are assumed to be equipped with multiple antennas. In our simulations, we consider both single- and multiple-relay scenarios over fading channels. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Timed analysis of security protocols
Authors: R. Corin S. Etalle P. H. Hartel A. Mader
Venue: Journal of Computer Security (2007)

We propose a method for engineering security protocols that are aware of timing aspects. We study a simplified version of the well-known Needham Schroeder protocol and the complete Yahalom protocol, where timing information allows the study of different attack scenarios. We model check the protocols using UPPAAL. Further, a taxonomy is obtained by studying and categorising protocols from the well known Clark Jacob library and the Security Protocol Open Repository (SPORE) library. Finally, we present some new challenges and threats that arise when considering time in the analysis, by providing a novel protocol that uses time challenges and exposing a timing attack over an implementation of an existing security protocol.
Pinpointing the Place of Origin of a Cellular Phone Emergency Call Using Active RFID Tags
Authors: Osamu Takizawa, Masafumi Hosokawa, Ken'ichi Takanashi, Yasushi Hada, Akihiro Shibayama, Byeong-pyo Jeong
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

When police, fire or ambulance personnel receive an emergency call, they must pinpoint its place of origin in order to respond quickly. When such a call is made from a cellular phone, its place of origin can be determined by using GPS or a cell-based positioning method. However, these methods are sometimes inaccurate and have blind spots. We developed a system for determining location using RFID-reader-equipped cellular phones and RFID tags. We outline the prototype system here.
A Descriptive Performance Model of a Load Balancing Single System Image
Authors: Bestoun S. Ahmed, Khairulmizam Samsudin, Abdul Rahman Ramli, ShahNor Basri
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Recent development in the load balancing single system image (SSI) provides a simple to use, cost effective and high performance environment, which has become increasingly attractive to many users. OpenMosix is one instance of a successful open source SSI cluster. Up date, there is no standard performance measurement metrics suitable for OpenMosix. A standard descriptive performance model benchmark allows developer and user to measure and compare performance of different SSI cluster design. The aim of this part of research is to study the effect of the number of nodes on some performance metrics by considering a particular network configuration and to investigate a framework for performance evaluation and modeling. The performance evaluation and benchmark show that the performance of the cluster is affected by the probabilistic and decentralized approach to disseminate load balancing information. A modification to the dissemination load balancing algorithm shows improved performance.
Analyzing Time Course Gene Expression Data with Biological and Technical Replicates to Estimate Gene Networks by State Space Models
Authors: Osamu Hirose, Ryo Yoshida, Rui Yamaguchi, Seiya Imoto, Tomoyuki Higuchi, Satoru Miyano
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In order to estimate accurate gene networks from time course gene expression data, replicated time course data are useful. However, existing methods do not clearly distinguish between biological and technical replicates, while these two kinds of replicates have different features. In this paper, we propose a statistical model based on state space models to use biologically and technically replicated time course data and show an algorithm to estimate a gene network that is a graphical representation of gene-gene regulation. To our knowledge, for estimating gene networks, the proposed model is the first model that can simultaneously use two types of replicated time course data. We show the effectiveness of the proposed method through the analysis of the microarray human T-cell data.
Virtual Reality Interaction System between User and Avatar with Distributed Processing
Authors: Shunji Uchino, Norihiro Abe, Hiroshi Takada, Tetsuya Yagi, Hirokazu Taki, Shoujie He
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this research, we have constructed a dialog environment between human and computers, and proposed and verified the method of operating the information which unified the verbal information and the non-verbal information. This system is a dialog structure that a user and a virtual human that exists in display can take communication by gesture and talk with. This is divided into three parts such as virtual human of display part and voice processing part, image processing part. We achieved that it is possible to realize the actual dialog environment with virtual human by connecting these three parts on network.
SmallBlue: People Mining for Expertise Search
Authors: Ching-Yung Lin, Kate Ehrlich, Vicky Griffiths-Fisher, Christopher Desforges
Venue: IEEE MultiMedia (2008)

SmallBlue finds experts, communities, and personal networks in large organizations through data mining, information retrieval, and artificial intelligence. By analyzing data from communication sources (emails, instant messages, and calendars) and Web 2.0 sources (blogs, wikis, social bookmarking systems, online profiles, and so on), the system answers questions about who knows what and who knows whom. SmallBlue-like services and system should continue attracting both researchers and industry developers to exploit the potential value in business intelligence.
Supporting Live Video on Ad Hoc Wireless Networks: Unbalanced Multiple Description Coding, Single Path Transport and Recursive Error Concealment
Authors: Feng Huang, Lifeng Sun, Bin Li, Yuzhuo Zhong
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Robust transmission of live video over ad hoc wireless networks presents new challenges: high bandwidth requirements are coupled with delay constraints; nodes are constrained in processing power and storage capacity; ad hoc wireless networks suffer from bursty packet losses that drastically degrade the viewing experience. Accordingly, we propose a simple, but practical unbalanced multiple description (UMD) codec that uses single path transport only. At the UMD decoder, the lost Low-Resolution (LR) frames can be recoded from the corresponding ones of the correctly received High-Resolution (HR) stream. This makes LR more robust to packet losses and ensures continuous video playback. The simulation results show that the proposed UMD codec has higher decoded quality, smaller quality fluctuation and lower probability of pause than other error resilience techniques, especially when channel burstiness becomes large. We also propose a novel sequence-based error concealment (EC) algorithm for our UMD decoder. It recursively uses multi-frame recovery principle to frame-by-frame reduce error drift in the HR description with respect to the LR description. In fact, the algorithm can be applied to most UMD schemes. It has the advantage of working on integer-, half- or quarter- pixel precision and looking backward without buffering future frames. Experimental results show that error decreases the fastest if the UMD decoder uses our EC algorithm. It can provide satisfactory performance on both objective and subjective evaluation.
Color Constancy from Image Transformations in JPEG and JPEG2000
Authors: German Tischler, Marc Ebner, Jürgen Albert
Venue: Proceedings of the Data Compression Conference (2008)

The ability of the human visual system to perceive colors as approximately constant under varying illumination conditions is called color constancy. The output of sensors in general varies with the type of illuminant and thus is not color constant. We present simple heuristics how color constancy can be implemented within JPEG and JPEG2000 using an adaption of the Retinex color constancy algorithm, where no assumptions are included with respect to the given light source and only little overhead is introduced in addition to the normal process.
Multiple Coupling Effects Oriented Path Delay Test Generation
Authors: Minjin Zhang, Huawei Li, Xiaowei Li
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

We propose a two-phase test generation method to generate patterns targeting maximal path delay caused by multiple crosstalk effects. A timing analysis method based on transition map is proposed to manage the timing information of aggressor lines and victim lines in the first phase, followed by an ordinary ATPG engine with a few alterations in the second phase. This two-phase method avoids complex timing processing in ATPG algorithm. Using transition map instead of timing window in timing analysis, our method can more efficiently calculate the accumulative crosstalk-induced delay and find the sub-paths which cause maximal coupling effects. We can trade off accuracy and efficiency by controlling the size of timescale used in transition map, which makes this approach highly scalable.
A Combined Platform of Wireless Sensors and Actuators Based on Embedded Controller
Authors: S. C. Mukhopadhyay, G. Sen Gupta, R. Y. M. Huang
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

This paper presents a combined platform of wireless sensors and actuators based on embedded controller. To proof the concept a fireworks detonation system utilizing MOSFETs to switch high current bursts has been developed. All required electronics, enclosure panel and control software have been fabricated. Commands are intelligently issued using an intuitive user interface. Manual control of channel firing and testing as well as a scripting system allow for complex and visually stunning firework demonstrations to be put together.
Exponential stability of impulsive Cohen&ndash;Grossberg networks with distributed delays
Authors: Zhenkun Huang, Xinghua Wang, Yonghui Xia
Venue: International Journal of Circuit Theory and Applications (2008)

In this paper, we investigate impulsive Cohen&ndash;Grossberg networks with distributed delays. By Lyapunov&ndash;Kravsovskii functional and homeomorphism theory, some new sufficient conditions are established for the existence and global exponential stability of a unique equilibrium without strict conditions imposed on self-regulation functions. The obtained sufficient conditions are easy to verify, meanwhile we remove the usual assumption that the activation functions are bounded and our results improve the previously known results. It is believed that these results are significant and useful for the design and applications of Cohen&ndash;Grossberg networks. Copyright &copy; 2007 John Wiley & Sons, Ltd.
A faster PSPACE algorithm for deciding the existential theory of the reals
Authors: J. Renegar
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

The decision problem for the existential theory of the reals is the problem of deciding if the set (x in R/sup n/; P(x) is nonempty, where P(x) is a predicate which is a Boolean function of atomic predicates either of which is a Boolean function of atomic predicates either of the form f/sub i/(x)>or=0 or f/sub j/(x)>, the f's being real polynomials. An algorithm is presented for deciding the existential theory of the reals that simultaneously achieves the best known time and space bounds. The time bound for the algorithm is slightly better than any previous bound.
Thermal oxidation of periodically aligned silicon square-spirals
Authors: M. A. Summers, M. J. Brett
Venue: Microelectronic Engineering (2008)

Thin films composed of silicon square-spirals in a square-lattice array are fabricated using glancing angle deposition and thermally oxidized at 600^oC, 700^oC, 800^oC, 900^oC and 1000^oC. The filling fraction of the square-spiral morphology increases from approximately 0.4 to values between 0.5 and 0.7, depending on oxidation temperature. Maximum filling fraction increase, and thin film expansion, is observed at 700^oC. Complete oxidation is achieved for oxidation temperatures of 700^oC and greater. This range of filling fractions is appropriate for a square-spiral template, which could be used to create the inverse silicon square-spiral photonic crystal structure using a template inversion process.
Dynamic parking negotiation and guidance using an agent-based platform
Authors: Shuo-Yan Chou, Shih-Wei Lin, Chien-Chang Li
Venue: Expert Systems with Applications: An International Journal (2008)

Modern prosperous cities strongly need advanced parking assistant systems, intelligent transportation systems providing drivers with parking information. Existing parking information systems usually ignore the parking price factor and do not automatically provide optimal car parks matching drivers' demand. Currently, the parking price has no negotiable space; consumers lose their bargaining position to obtain better and cheaper parking. This study uses an intelligent agent system, and considering negotiable parking prices, selects the optimal car park for the driver. The autonomous coordination activities challenge traditional approaches and call for new paradigms and supporting middleware. An agent-based coordination network is proposed to bring true benefit to drivers and car park operators. These modern intelligent agents have capabilities including planning, mobility, execution monitoring and coordination. These properties can be used to construct the integrated parking assistant system.
On the relation between rhythm complexity measures and human rhythmic performance
Authors: Eric Thul, Godfried T. Toussaint
Venue: Proceedings of the 2008 C3S2E conference (2008)

Six measures of musical rhythm complexity were compared experimentally to human difficulty of performance (performance complexity) using two data sets of rhythms, via phylogenetic trees of the rank-correlation coefficient matrices obtained from rankings of the rhythms according to the complexity measures. The results suggest the hypothesis that measures of rhythmic syncopation that are based on a weighted metrical hierarchy, are better predictors of human performance difficulty than measures based on cognitive complexity, weighted distances from onsets to beats, or mathematical irregularity.
Lotus Domino Web Access (DWA) 6.5 Quick Reference Guide
Authors: Beezix Inc
Venue:  (2007)

Laminated quick reference guide showing step-by-step instructions for Lotus Domino Web Access (iNotes) 6.5. Topics include: Mail: Logging into Notes Mail via a Browser, Displaying the Inbox, Reading an E-mail Message, Opening an Attachment, Replying to a Message, Forwarding a Message, Creating and Sending a Mail Message, Addressing a Message by Typing, Addressing a Message by Choosing from a List, Saving a Draft Message, Completing a Draft Message, Attaching a File to a Message, Indicating Importance of a Message, Adding a Person to your Contacts List, Creating a Personal Mailing List, Flagging Messages for Follow-Up, Moving a Message to a Folder, Creating a Folder, Removing a Folder, Deleting a Message, Restoring a Previously Deleted Message, Emptying the Trash, Appending a Signature to New Memos, Telling People you are Away with the Out of Office Agent, Turning off Out of Office, Filtering Incoming Messages Automatically, Turning a Rule Off or On, Blocking E-Mail from a Specific Sender. Calendar: Displaying the Calendar, Using the Date Navigator, Creating a New Calendar Entry, Types of Calendar Items, Inviting People to Meetings, Responding to Meeting Invitations and Reschedule Notices. To Do's: Displaying the To Do List, Creating a To Do Entry, Completing a To Do Item. Notebook: Creating a New Notebook Page, Opening and Reading a Notebook Page, Editing an Opened Notebook Page, Logging Out. This guide is suitable as a training handout, or simply an easy to use reference guide, for any type of user.
Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest
Authors: Gang Chen, Chor Ping Low, Zhonghua Yang
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

Peer-to-Peer (P2P) networks establish loosely-coupled application-level overlays on top of the Internet to facilitate efficient sharing of resources. They can be roughly classified as either structured or unstructured networks. Without stringent constraints over the network topology, unstructured P2P networks can be constructed very efficiently and are therefore considered suitable to the Internet environment. However, the random search strategies adopted by these networks usually perform poorly with large network size. In this paper, we seek to enhance the search performance in unstructured P2P networks through exploiting users' common interest patterns captured within a probability-theoretic framework termed the user interest model (UIM). A search protocol and a routing table updating protocol are further proposed in order to expedite the search process through self-organizing the P2P network into a small world. Both theoretical and experimental analysis are conducted and demonstrated the effectiveness and efficiency of our approach.
Analysis and Optimization of a Wireless Communication System for an Ingestable Sensor Microsystem
Authors: Nizamettin Aydin, Tughrul Arslan
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

Wireless communication systems targeting miniaturized sensor microsystem networks are characterized by their restricted power and area constraints. DS-SS systems are well suited for such applications. When considering the design of a communication system for such a network, the receiver is the key critical block. This paper discusses the impact of input data characteristics and resolution together with internal data path complexity on area and power performance of the receiver. A number of transmitter/receiver architectures have been constructed and their power/area have been analyzed. Up to 59% and 11% savings in area and power respectively could be achieved by optimizing input data size and internal register width for a particular application while maintaining signal quality.