ppxscal/embedding_network huggingface dataset:
Spatiotemporal Visuotactile Interaction
Authors: Ju-Hwan Lee, Charles Spence
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

Over the last few years, a growing number of IT devices have started to incorporate touch-screen technology in order to create more effective multimodal user interfaces. The use of such technology has opened up the possibility of presenting different kinds of tactile feedback (i.e., active vs. passive) to users. Here, we report 2 experiments designed to investigate the spatiotemporal constraints on the multisensory interaction between vision and touch as they relate to a user's active vs. passive interaction with a touch screen device. Our results demonstrate that when touch is active, tactile perception is less influenced by irrelevant visual stimulation than when passively touching the screen. Our results also show that vision has to lead touch by approximately 40ms in order for optimal simultaneity to be perceived, no matter whether touch is active or passive. These findings provide constraints for the future design of enhanced multimodal interfaces.
CLTC: A Cluster-Based Topology Control Framework for Ad Hoc Networks
Authors: Chien-Chung Shen, Chavalit Srisathapornphat, Rui Liu Zhuochuan Huang, Chaiporn Jaikaeo, Errol L. Lloyd
Venue: IEEE Transactions on Mobile Computing (2004)

The topology of an ad hoc network has a significant impact on its performance in that a dense topology may induce high interference and low capacity, while a sparse topology is vulnerable to link failure and network partitioning. Topology control aims to maintain a topology that optimizes network performance while minimizing energy consumption. Existing topology control algorithms utilize either a purely centralized or a purely distributed approach. A centralized approach, although able to achieve strong connectivity (k--connectivity for k \geq 2), suffers from scalability problems. In contrast, a distributed approach, although scalable, lacks strong connectivity guarantees. We propose a hybrid topology control framework, Cluster-based Topology Control (CLTC), that achieves both scalability and strong connectivity. By varying the algorithms utilized in each of the three phases of the framework, a variety of optimization objectives and topological properties can be achieved. In this paper, we present the CLTC framework; describe topology control algorithms based on CLTC and prove that k-connectivity is achieved using those algorithms; analyze the message complexity of an implementation of CLTC, namely, CLTC-A, and present simulation studies that evaluate the effectiveness of CLTC-A for a range of networks.
Circuitry Analog and Synchronization of Hyperchaotic Neuron Model
Authors: Shukai Duan, Lidan Wang
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

Recently, a general model of nonlinear systems with distributed delays is studied and a four-dimensional continuous autonomous chaotic neuron model is found and analyzed. In this paper, circuitry analog of the chaotic neuron model is introduced. Adaptive chaos synchronization scheme is presented and analyzed. A series of computer simulations demonstrated the effectiveness of the proposed synchronization schemes.
Calculating the Number of Tunnels
Authors: Fajie Li, Reinhard Klette
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

This paper considers 2-regions of grid cubes and proposes an algorithm for calculating the number of tunnels of such a region. The graph-theoretical algorithm proceeds layer by layer; a proof of its correctness is provided, and its time complexity is also given.
KAF: Kalman Filter Based Adaptive Maintenance for Dependability of Composite Services
Authors: Huipeng Guo, Jinpeng Huai, Yang Li, Ting Deng
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

Service composition is fundamental in development of Web service oriented applications. Dependability of composite services is of significant importance since it directly impacts users' experience. However, dependability of a composite service may change over time as a result of inevitable changes in component services. In addition, users may also pose varying dependability requirements to meet different needs. It has become a big challenge to dynamically maintain the dependability of composite services. This paper proposes an innovative system called KAF that constructs a closed-loop control for adaptive maintenance of composite services. Modeling the control process as a Markov decision process (MDP), we further design an efficient Kalman-Filter based algorithm for service state prediction. With the availability of the precise prediction, optimal control decisions can be made. We evaluate the performance of KAF against other alternative approaches through comprehensive experiments and results demonstrate that KAF is capable for adaptive dependability maintenance.
Fair K Mutual Exclusion Algorithm for Peer to Peer Systems
Authors: Vijay Anand Reddy, Prateek Mittal, Indranil Gupta
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

k-mutual exclusion is an important problem for resource-intensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual exclusion algorithms not only need to be safe and live, but they also need to be fair across hosts. We propose a new solution to the k-mutual exclusion problem that provides a notion of time-based fairness. Specifically, our algorithm attempts to minimize the spread of access time for the critical resource. While a client's access time is the time between it requesting and accessing the resource, the spread is defined as a system-wide metric that measures some notion of the variance of access times across a homogeneous host population, e.g., difference between max and mean. We analytically prove the correctness of our algorithm, and evaluate its fairness experimentally using simulations. Our evaluation under two settings - a LAN setting and a WAN based on the King latency data set - shows even with 100 hosts accessing one resource, the spread of access time is within 15 seconds.
The Proposal of the Association Response Based on Commonsense in Conversation System
Authors: Eriko Yoshimura, Seiji Tsuchiya, Hirokazu Watabe, Tsukasa Kawaoka
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

This paper proposes one of a response production method on chatting system automatically. Our approach is applied to Japanese language. This is not necessary that it achieve a task. The responses support our conversation flow and let us produce a new topic. The system will get much information for the speaker by performing much conversation with this system. Based on the much information by a conversation with the system, the flexible reply for a speaker will come to be possible. In the present paper, we propose a response by association of the input sentence. For example, we associate "medical treatment" with "hospital". We reply then using the association word. If, like humans, a machine can reply using the association word, it will return various flexible responses.
Fuzzy Rule Based Edge-Sensitive Line Average Algorithm in Interlaced HDTV Sequences
Authors: Gwanggil Jeon, Jungjun Kim, Jongmin You, Jechang Jeong
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

This paper proposes a spatial domain deinterlacing method which is based on fuzzy rule and edge-sensitive line average algorithm. The proposed algorithm consists two parts: edge direction detection part and fuzzy rule based edge-sensitive interpolation part. Once the edge direction is determined, in order to accurately reconstruct boundary of edges and peaks, edge-sensitive interpolation is utilized. Detection and interpolation results are presented. Experimental results show that the proposed algorithm provides a significant improvement over other existing deinterlacing methods.
Using "Cited by" Information to Find the Context of Research Papers
Authors: Chun-Hung Lu, Chih-Chien Wang, Min-Yuh Day, Chorng-Shyong Ong, Wen-Lian Hsu
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

This paper proposes a novel method of analyzing data to find important information about the context of research papers. The proposed CCTVA (Collecting, Cleaning, Translating, Visualizing, and Analyzing) method helps researchers find the context of papers on topics of interest. Specifically, the method provides visualization information that maps a research topic's evolution and links to other papers based on the results of Google Scholar and CiteSeer. CCTVA provides two types of information: one type shows the paper's title and the author, while the other shows the paper's title and the reference. The goal of CCTVA is enable both novices and experts to gain insight into how a field's topics evolve over time. In addition, by using linkage analysis and visualization, we identify five special phenomena that can help researchers conduct literature reviews.
Effects of Space Design Visualization on Users' Subjective States
Authors: Shigeyoshi Iizuka, Yusuke Goto
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

We developed a system that visualizes how design of interior space affects user's subjective states when they are communicating personal information on a computer. After measuring the subjective reassurance of users while they were communicating information, we used the results to plot and create personal information spaces. Then the subjective aspects of workspace design were visualized based on these personal information spaces. Designers can intuitively understand the subjective aspects of space design visualized based on a user's subjective states using our system.
Classification of Normal and Tumor Tissues Using Geometric Representation of Gene Expression Microarray Data
Authors: Saejoon Kim, Donghyuk Shin
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

Microarray is a fascinating technology that provides us with accurate predictions of the state of biological tissue samples simply based on the expression levels of genes available from it. Of particular interest in the use of microarray technology is the classification of normal and tumor tissues which is vital for accurate diagnosis of the disease of interest. In this paper, we shall make use of geometric representation from graph theory for the classification of normal and tumor tissues of colon and ovary. The accuracy of our geometric representation-based classification algorithm will be shown to be comparable to that of the currently known best classification algorithms for the two datasets. In particular, the presented algorithm will be shown to have the highest classification accuracy when the number of genes used for classification is small.
Front tracking with moving-least-squares surfaces
Authors: João Paulo Gois, Anderson Nakano, Luis Gustavo Nonato, Gustavo C. Buscaglia
Venue: Journal of Computational Physics (2008)

The representation of interfaces by means of the algebraic moving-least-squares (AMLS) technique is addressed. This technique, in which the interface is represented by an unconnected set of points, is interesting for evolving fluid interfaces since there is no surface connectivity. The position of the surface points can thus be updated without concerns about the quality of any surface triangulation. We introduce a novel AMLS technique especially designed for evolving-interfaces applications that we denote RAMLS (for Robust AMLS). The main advantages with respect to previous AMLS techniques are: increased robustness, computational efficiency, and being free of user-tuned parameters. Further, we propose a new front-tracking method based on the Lagrangian advection of the unconnected point set that defines the RAMLS surface. We assume that a background Eulerian grid is defined with some grid spacing h. The advection of the point set makes the surface evolve in time. The point cloud can be regenerated at any time (in particular, we regenerate it each time step) by intersecting the gridlines with the evolved surface, which guarantees that the density of points on the surface is always well balanced. The intersection algorithm is essentially a ray-tracing algorithm, well-studied in computer graphics, in which a line (ray) is traced so as to detect all intersections with a surface. Also, the tracing of each gridline is independent and can thus be performed in parallel. Several tests are reported assessing first the accuracy of the proposed RAMLS technique, and then of the front-tracking method based on it. Comparison with previous Eulerian, Lagrangian and hybrid techniques encourage further development of the proposed method for fluid mechanics applications.
Provably Secure Grouping-Proofs for RFID Tags
Authors: Mike Burmester, Breno Medeiros, Rossana Motta
Venue: Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications (2008)

We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is to study the group scanning problem in strong adversarial models. We present a security model for this application and give a formal description of the attending security requirements, focusing on the privacy (anonymity) of the grouped tags, and/ or forward-security properties. Our model is based on the Universal Composability framework and supports re-usability (through modularity of security guarantees). We introduce novel protocols that realize the security models, focusing on efficient solutions based on off-the-shelf components, such as highly optimized pseudo-random function designs that require fewer than 2000 Gate-Equivalents.
Theoretical and experimental results on the goal-plan tree problem
Authors: Patricia H. Shaw, Berndt Farwer, Rafael H. Bordini
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Agents programmed in BDI-inspired languages have goals to achieve and a library of plans that can be used to achieve them, typically requiring further goals to be adopted. This is most naturally represented by a structure that has been called a Goal-Plan Tree. One of the uses of such structure is in agent deliberation (in particular, deciding whether to commit to achieving a certain goal or not). This paper presents new experimental results combining various types of goal-plan tree reasoning from the literature.
Agreement and consistency without knowing the number of processes
Authors: Mohssen Abboud, Carole Delporte-Gallet, Hugues Fauconnier
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

We study in this paper three classical problems of fault tolerance in a system where the set of processes is unknown. These three problems are: the consensus, the implementation of atomics registers and the eventual leader election. For this, we consider different models. In the first one, the communication and the processes are asynchronous. In this model, these three problems could not be solved, but we define the weakest failure detectors needed to solve them. We consider then a model where the processes and the communication are synchronous, which permit to realize synchronous rounds. In this case, the processes are created dynamically and may have crash failures. We prove that, if for all rounds at least one process is alive in two consecutive rounds, the consensus and the implementation of registers could be solved. The eventual leader election, which is in this case less interesting, can be solved also. Between these two extremities, we focus on the case where the communications are asynchronous. Concerning processes, we assume that, onetime a process is created, it remains alive forever. In this case, if the leader election is easy, the consensus and the implementation of registers are impossible. If we augment the system with the failure detector (&Sigma;) which permits to realize a quorum, consensus and implementation of atomic register can be solved. At the end, we consider a partially synchronous model and we prove that the consensus and the implementation of atomic register could be solved if there exists a process that can communicate synchronously with the other processes.
Review of Packet Switching Technologies for Future NoC
Authors: Dawid Zydek, Neveen Shlayan, Emma Regentova, Henry Selvaraj
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

Recent technological developments have shown huge advances in semi-conductor based System on Chip (SoC). However, limitations of such technology has quickly become an obstacle for the fast and highly demanding development of general or application specific SoCs. Since research in semi-conductor devices has reached its saturation, researchers look for alternative solutions. Optical technology is emerging as the leader due to its very high bandwidth capabilities (the main constraint of semi-conductor technology). In this paper, we analyze the most recent developments for optical Network on Chip (NoC) as a basic architecture for SoC. Packet switching remains most popular due to scalability and reliability issues, as well as due to variety of applications it is designed for. While optical switching technologies promise high speed interconnection, buffering technologies haven’t matured enough to support fully optical packet switching NoCs. What is the current state and what are the expectations from the optical/photonics technologies? The paper tries to study these issues and provide an answer.
Architectural Solutions for Mobile RFID Services for the Internet of Things
Authors: Martin Peter Michael, Mohsen Darianian
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

Mobile RFID services for the Internet of Things can be provided either on mobile devices as stand-alone services or in combination with end-to-end systems. When different service solutions are considered, there is more than one possible architecture solution for the network, mobile device and the back-end server. Combining the solutions wisely by applying the software architecture and engineering principles, a combined solution can be formulated for certain application specific use cases. This paper proposes a methodology and a service solution concept called “Quasi-Rich-Client” by illustrating the ideas in a real case study.
Formation Control of Multiple Robots Using Parametric and Implicit Representations
Authors: Yesim H. Esin, Mustafa Unel, Mehmet Yildiz
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

A novel method is presented for formation control of a group of autonomous mobile robots using parametric and implicit descriptions of the desired formation. Shape formation is controlled by using potential fields generated from Implicit Polynomial (IP) representations and the control for keeping the desired shape is designed using Elliptical Fourier Descriptors (EFD). Coordination of the robots is modeled by linear springs between each robot and its nearest two neighbors. This approach offers more flexibility in the formation shape and scales well to different swarm sizes and to heterogeneous systems. The method is simulated on robot groups with different sizes to form various formation shapes.
A Structured Methodology of Scenario Generation and System Analysis for Ubiquitous Smart Space Development
Authors: Ohbyung Kwon, Yonnim Lee
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

Ubiquitous smart space (USS) has been regarded as a promising extension of ubiquitous services, and it is currently the subject of world-wide development. In one USS development methodology, scenario development is performed before system analysis and design. However, even though many redundant elements can be found between scenarios and system analysis results, developers have not been taking any structural approaches to join them together for more consistency and eventually higher productivity. Hence, the aim of this paper is to propose a methodology to increase the consistency in the early steps of USS development. To do so, scenario and requirement analysis are integrated in a structured manner.
Two-Phase Web Service Discovery Based on Rich Functional Descriptions
Authors: Michael Stollberg, Uwe Keller, Holger Lausen, Stijn Heymans
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

Discovery is a central reasoning task in service-oriented architectures, concerned with detecting Web services that are usable for solving a given request. This paper presents two extensions in continuation of previous works towards goal-based Web service discovery with sophisticated semantic matchmaking. At first, we distinguish goal templates as generic objective descriptions and goal instances that denote concrete requests as an instantiation of a goal template. Secondly, we formally describe requested and provided functionalities on the level of state transitions that denote executions of Web services, respectively solutions for goals. Upon this, we specify a two-phase discovery procedure along with semantic matchmaking techniques that allow to accurately determine the usability of a Web service. The techniques are defined in the Abstract State Space model that supports several languages for describing Web services.
The telecommunication and information industries: US patent policy and the criterion of non-obviousness
Authors: Thomas A. Hemphill
Venue: Telematics and Informatics (2009)

In this topic discussion paper, the legal and public policy issues surrounding the ''novel'' and ''non-obvious'' criterion that the US Patent and Trademark Office uses in awarding a patent are explored. The application of the latter criteria for granting a patent - that the invention be ''non-obvious'' - has been a significant concern for many firms in the telecommunications and information industries. Following an introduction discussing the Constitutional basis of intellectual property rights and the criteria employed by the US Patent and Trademark Office in awarding patent rights, this paper will explain the modern evolution of the legal expression ''non-obviousness'', up to, and including, the most recent patent appeals case (and potentially the one having the most far-reaching impact on patent granting) heard by the US Supreme Court, KSR International Co. v. Teleflex. Inc. et al. In the next section, a review of three major national policy reports on reforming the US patent system (two national reports and one by an academic economist) - focusing on the expert recommendations pertaining to the implementation of the legal expression of ''non-obviousness'' - is undertaken. Lastly, the final section of the paper offers a patent policy discussion associated with the latest interpretation of the ''non-obviousness'' criterion, and explains possible policy effects on the competitive environment of the telecommunications and information industries.