ppxscal/embedding_network huggingface dataset:
Research on the Robustness of a Proportional Integral Switching Surface Based on Sliding Mode Control
Authors: Jun Liu, Yang Wang, Meng-zhi Huang, Jian-bo Lu
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In this paper, a novel proportional-integral (PI) switching surface is introduced for determining the synchronization performance of systems in the sliding mode motion. Based on the sliding mode controller, the system is established by a robust control scheme which guarantees the occurrence of a sliding motion of error states even when the parameter uncertainty and external disturbance are present. So this paper researches on robust synchronization problem by investigating a highly complex dynamic nonlinear system—chaotic systems. Some simulation results on controlling different chaotic systems are made and investigated in order to demonstrate the good performance of the method and this control design process is much easier to be completed.
A computing environment for the blind
Authors: Morteza Amir Rahimi, John B. Eulenberg
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Much of the early work on applying computer technology to the development of sensory aids for the blind was devoted to systems for transforming ink-print texts into a Braille format. This continues to be an important use of computers, but the disadvantages of Braille render it a poor substitute for the modes of information access normally available to people with normal sight. Braille is embossed on bulky paper. The surface area required for tactile discrimination of the Braille dots add to the problem, since this means that a Braille text takes up more space than a corresponding ink-print text. Furthermore, the ability to read Braille takes considerable time to acquire, and not all visually handicapped persons can read Braille, due to concomitant handicaps or because their visual impairment came fairly late in life. Braille also has the disadvantage that it is unreadable to almost all sighted persons; blind persons cannot read what sighted persons can read, and vice versa. Many blind persons are excellent typists, so they can indeed communicate in writing to the sighted, but they have no way of proofreading their own typing.
Relating folksonomies with Dublin Core
Authors: Maria Elisabete Catarino, Ana Alice Baptista
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

Folksonomy is the result of describing Web resources with tags created by Web users. Although it has become a popular application for the description of resources, in general terms Folksonomies are not being conveniently integrated in metadata. However, if the appropriate metadata elements are identified, then further work may be conducted to automatically assign tags to these elements (RDF properties) and use them in Semantic Web applications. This article presents research carried out to continue the project Kinds of Tags, which intends to identify elements required for metadata originating from folksonomies and to propose an application profile for DC Social Tagging. The work provides information that may be used by software applications to assign tags to metadata elements and, therefore, means for tags to be conveniently gathered by metadata interoperability tools. Despite the unquestionably high value of DC and the significance of the already existing properties in DC Terms, the pilot study show revealed a significant number of tags for which no corresponding properties yet existed. A need for new properties, such as Action, Depth, Rate, and Utility was determined. Those potential new properties will have to be validated in a later stage by the DC Social Tagging Community.
Quantum Query Complexity of Boolean Functions with Small On-Sets
Authors: Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

The main objective of this paper is to show that the quantum query complexity Q(f) of an N-bit Boolean function f is bounded by a function of a simple and natural parameter, i.e., M = |{x|f(x) = 1}| or the size of f's on-set. We prove that: (i) For $poly(N)\le M\le 2^{N^d}$ for some constant 0 < d < 1, the upper bound of Q(f) is $O(\sqrt{N\log M / \log N})$. This bound is tight, namely there is a Boolean function f such that $Q(f) = \Omega(\sqrt{N\log M / \log N})$. (ii) For the same range of M, the (also tight) lower bound of Q(f) is $\Omega(\sqrt{N})$. (iii) The average value of Q(f) is bounded from above and below by $Q(f) = O(\log M +\sqrt{N})$ and $Q(f) = \Omega (\log M/\log N+ \sqrt{N})$, respectively. The first bound gives a simple way of bounding the quantum query complexity of testing some graph properties. In particular, it is proved that the quantum query complexity of planarity testing for a graph with n vertices is &theta;(N 3/4) where $N = \frac{n(n-1)}{2}$.
Exploiting predictor domain information in sufficient dimension reduction
Authors: Lexin Li
Venue: Computational Statistics Data Analysis (2009)

Analysis of high-dimensional data is becoming the norm in a variety of scientific studies and dimension reduction methods are widely employed. As the predictor domain knowledge is often available, it is useful to incorporate such domain information into dimension reduction and subsequent model formulation. Existing solutions such as simple average, principal components analysis and partial least squares cannot assure preservation of full regression information when reducing the dimension. In this article we investigate sufficient dimension reduction strategies that can retain full regression information meanwhile utilizing prior domain knowledge. Both simulations and a real data analysis demonstrate that the new methods are effective and often superior than the existing solutions.
On the Low Complexity Construction of Quasi-Cyclic Low-Density Parity-Check Codes by Progressive-Block Growth
Authors: Qiangy Yuan, Pinyi Ren, Yilin Feng, Jun Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, we propose a novel method with low complexity for constructing quasi-cyclic LDPC codes. The algorithm chooses every circulant permutation matrix sequentially, and makes sure that the current circulant permutation matrix forms no cycles of length 4 and 6 with the existent matrices, finally a family of $(3,L)$ QC-LDPC codes with girth at least 8 is obtained. The main complexity of the algorithm is checking cycles of length 6, the number of which is no more than $L^2$. Simulation results show that, when block length is 1008 and using the iterative belief propagation decoding, the LDPC code constructed by the proposed algorithm out performs the random code about 0.1dB at the bit-error-rate of $ 10^{ - 5}$.
A heuristic approach to computer systems performance improvement, I: a fast performance prediction tool
Authors: Stephen R. Kimbleton
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The design, sizing and tuning of computer systems is a persistent, expensive, time-consuming, and difficult problem. An appropriate, integrated support methodology to support the needs of the computer center manager vis-a-vis these issues is lacking. Although the performance literature related to this topic is voluminous, much of it is directed to the vendor rather than the computer center manager.
An algorithm for computing simple k-factors
Authors: Henk Meijer, Yurai Núòez-Rodríguez, David Rappaport
Venue: Information Processing Letters (2009)

A k-factor of graph G is defined as a k-regular spanning subgraph of G. For instance, a 2-factor of G is a set of cycles that span G. 2-factors have multiple applications in Graph Theory, Computer Graphics, and Computational Geometry. We define a simple 2-factor as a 2-factor without degenerate cycles. In general, simple k-factors are defined as k-regular spanning subgraphs where no edge is used more than once. We propose a new algorithm for computing simple k-factors for all values of k>=2.
A computational narrative construction method with applications in organizational learning of social service organizations
Authors: W. M. Wang, C. F. Cheung, W. B. Lee, S. K. Kwok
Venue: Expert Systems with Applications: An International Journal (2009)

Acquisition of knowledge must be interwoven with the process of applying it. However, traditional training methods which provide abstract knowledge have shown ineffective for gaining experience of the work. In order to solve this problem, more and more researchers have included narrative in simulation, which is known as narrative simulation. By providing the narratives, participants recognize the choices, decisions, and experience that lead to the consequences of those decisions. It has been proven that narrative simulation is very useful in facilitating in-depth learning and reflective learning. However, conventional methods of data collection and narrative construction for narrative simulation are labor intensive and time consuming. They make use of previous narratives manually and directly. They are inadequate to cope with the fast moving world where knowledge is changing rapidly. In order to provide a way for facilitating the construction of narrative simulation, a novel computational narrative construction method is proposed. By incorporating technologies of knowledge-based system (KBS), computational linguistics, and artificial intelligence (AI), the proposed method provides an efficient and effective way for collecting narratives and automating the construction of narratives. The method converts the unstructured narratives into a structural representation for abstraction and facilitating computing processing. Moreover, it constructs the narratives that combine multiple narratives into a single narrative by applying a forecasting algorithm. The proposed method was successfully implemented in early intervention in mental health care of a social service company in Hong Kong since the case records in that process have structural similarities to narrative. The accuracies of data conversion and predictive function were measured based on recall and precision and encouraging results were obtained. High recall and precision are achieved in the data conversion function, and high recall for the predictive function when new concepts are excluded. The results show that it is possible for converting multiple narratives into a single narrative automatically. Based on the approach, it helps to stimulate knowledge workers to explore new problem solving methods so as to increase the quality of their solutions.
Understanding how and why open source contributors use diagrams in the development of Ubuntu
Authors: Koji Yatani, Eunyoung Chung, Carlos Jensen, Khai N. Truong
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Some of the most interesting differences between Open Source Software (OSS) development and commercial co-located software development lie in the communication and collaboration practices of these two groups of developers. One interesting practice is that of diagramming. Though well studied and important in many aspects of co-located software development (including communication and collaboration among developers), its role in OSS development has not been thoroughly studied. In this paper, we report our investigation on how and why Ubuntu contributors use diagrams in their work. Our study shows that diagrams are not actively used in many scenarios where they commonly would in co-located software development efforts. We describe differences in the use and practices of diagramming, their possible reasons, and present design considerations for potential systems aimed at better supporting diagram use in OSS development.
Proof of the local REM conjecture for number partitioning. II. Growing energy scales
Authors: Christian Borgs, Jennifer Chayes, Stephan Mertens, Chandra Nair
Venue: Random Structures Algorithms (2009)

We continue our analysis of the number partitioning problem with n weights chosen i.i.d. from some fixed probability distribution with density &rho;. In Part I of this work, we established the so-called local REM conjecture of Bauke, Franz and Mertens. Namely, we showed that, as n &rarr; &infin;, the suitably rescaled energy spectrum above some fixed scale &alpha; tends to a Poisson process with density one, and the partitions corresponding to these energies become asymptotically uncorrelated. In this part, we analyze the number partitioning problem for energy scales &alpha;n that grow with n, and show that the local REM conjecture holds as long as n-1-4&alpha;n &rarr; 0, and fails if &alpha;n grows like &kappa;n1-4 with &kappa; > 0. We also consider the SK-spin glass model, and show that it has an analogous threshold: the local REM conjecture holds for energies of order o(n), and fails if the energies grow like &kappa;n with &kappa; > 0. &copy; 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2009 This work was done during the period when C.N. was a graduate student at Stanford and later a post-doc at Microsoft Research.
Web-based multiuser interior design with virtual reality technology
Authors: Yen-Chun Lin, Chen-Chuan Pan
Venue: WSEAS Transactions on Computers (2009)

A Web-based interior design application system, named Multiuser Interior Design (MID), is presented. Technologies from virtual reality (VR), the Web, and database are used to implement MID. It allows users to operate in the VR fashion, interacting with 3D virtual objects and spaces through a Web browser. Users can view and elaborate designs, examine furniture, and even place purchase orders of furniture. MID contains various features, including multiuser collaboration and concurrent display of multiple views of a scene. MID can be modified for other e-commerce purposes; many of the functions serve as a reusable framework.
An Integrated Guide and Control Strategy to Enhance the Precision of Guidance Laws
Authors: Zhenhao Zhao, Yi Shen, Qiang Wang
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

Recently, ballistic missiles, in particular, Intercontinental ballistic missile (ICBM), with their high speed and high maneuverability, have posed great challenges for traditional intercepting techniques and methods. Despite the promising prospect of a new method, head-pursuit (HP) guidance method, there still exist problems that need to be solved. To address these problems, this paper, basing on sliding mode theory, proposes an integrated nonlinear guide-control strategy which takes into account both missile’s control loop character and guidance loop character. This strategy can effectively resolve escape maneuver of the target so that a favorable guide quality is still achievable even if the control loop is not compensated. Simulation is also done to test the validity of the integrated strategy we propose. And finally different guide and control qualities considering the dynamic features of different orders are compared to provide reference for practical engineering application in the future.
Espace de caract&eacute;risation du stylo num&eacute;rique
Authors: Sylvain Malacria, Eric Lecolinet
Venue: Proceedings of the 20th International Conference of the Association Francophone d'Interaction Homme-Machine (2008)

Despite computers and PDAs are now so common, the pen / paper couple is still widely used in practice. However, as it belongs to the "physical world", it is strongly separated from "digital world" applications. In this paper, we focus on digital pen technology and explore the bridges it can provide between tangible and digital objects. We propose a framework that relies on the properties of digital pen and interactive paper and on how users can interact with these tools.
Improving low voltage distribution line carrier communication systems for transferring data by applying efficient modulation techniques
Authors: Shahram Javadi, Parastoo Pourang
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

Distribution Line Communications technology allows the usage of electrical power supply networks for communications purposes and, today, also broadband communication services. The main idea behind DLC is the reduction in operational costs and expenditure for realization of new telecommunications networks. Using electrical supply networks for telecommunications has also been known since the beginning of the twentieth century. Thus high-, medium- and low-voltage supply networks have been used for internal communications of electrical utilities and for the realization of remote measuring and control tasks. Generally, we can divide DLC systems into two groups: narrowband DLC allowing communications services with relatively low data rates (up to 100 kbps) and ensuring realization of various automation and control applications as well as a few voice channels, and broadband DLC systems allowing data rates beyond 2Mbps and, accordingly, realization of a number of typical telecommunications services in parallel, such as telephony and internet access. This paper discusses the various methods of modulation techniques for application of distribution line carrier (DLC) systems on medium voltage lines for the purpose of energy management and system control. Depending on the attenuation the range of the technology is up to several kilometers.
Life-like Communication Agent -Emotion Sensing Character "MIC" & Feeling Session Character "MUSE"-
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Why do people, regardless of age or gender, have an affinity for objects manifested in the human form? From the earthen figures of ancient times to mechanical dolls, teddy bears and robots, is it not true that man has conceived such objects in his imagination, then formed attachments and transferred emotions to them? In this paper, we address the issues of communication and esthetics of artificial life that possess this "human form" in modern society, both from artistic and engineering standpoints. An example is presented in which emotions are interpreted from human voices and emotional responses are triggered within the interactive setting of "MIC & MUSE." 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
Flagellated Magnetotactic Bacteria as Controlled MRI-trackable Propulsion and Steering Systems for Medical Nanorobots Operating in the Human Microvasculature
Authors: Sylvain Martel, Mahmood Mohammadi, Ouajdi Felfoul, Zhao Lu, Pierre Pouponneau
Venue: International Journal of Robotics Research (2009)

Although nanorobots may play critical roles for many applications in the human body, such as targeting tumoral lesions for therapeutic purposes, miniaturization of the power source with an effective onboard controllable propulsion and steering system have prevented the implementation of such mobile robots. Here, we show that the flagellated nanomotors combined with the nanometer-sized magnetosomes of a single magnetotactic bacterium can be used as an effective integrated propulsion and steering system for devices, such as nanorobots, designed for targeting locations only accessible through the smallest capillaries in humans while being visible for tracking and monitoring purposes using modern medical imaging modalities such as magnetic resonance imaging. Through directional and magnetic field intensities, the displacement speeds, directions, and behaviors of swarms of these bacterial actuators can be controlled from an external computer.
Imaging of Flame Behavior in Flickering Methane/Air Diffusion Flames
Authors: N. Yilmaz, A. B. Donaldson, W. Gill, R. E. Lucero
Venue: Journal of Visualization (2009)

During this study, flow visualization through the use of imaging provided visual data of the events that occurred as the flame oscillated. Imaging was performed in two different ways: 1) the first method was phase-locked imaging to capture a detailed history by simply advancing the phase angle during each image capture, 2) the second method involved high-speed imaging to gather visual image data of a natural or forced oscillating flame. For visualization, two items were considered. The first one was the shape of the flame envelope as it evolved during one oscillation cycle. From the data gathered, it was confirmed that the flame stretched in the vertical direction before quenching in the region near its center. The second consideration was imaging of the oxidizer (air) in the region immediately outside the flame. This was done by imaging the laser light reflected from particles seeded into the flow, which revealed formation of vortical structures in those regions where quenching had occurred. It was noted that quenching took place primarily by the entrainment of fresh non-reacting air into the flame. The quenching process was in turn responsible for the oscillatory behavior.
An Emotional Intelligent E-learning System Based on Mobile Agent Technology
Authors: Zhiliang Wang, Xiangjie Qiao, Yinggang Xie
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

The emergence of the concept "Affective Computing" makes the computer's intelligence no longer be a pure cognitive one. Current e-learning systems cannot instruct students effectively since they do not consider the emotional state in the context of instruction. In this paper, we construct an emotional intelligent e-learning system based on mobile agent technology. A dimensional model is put forward to recognize and analyze the student's emotion state and a virtual teacher’s avatar is offered to regulate student's learning psychology with consideration of teaching style based on his personality trait. A "man-to-man" learning environment is built to simulate the traditional classroom's pedagogy in the system.
Motion Primitives and Probabilistic Edit Distance for Action Recognition
Authors: Preben Fihl, Michael B. Holte, Thomas B. Moeslund
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

The number of potential applications has made automatic recognition of human actions a very active research area. Different approaches have been followed based on trajectories through some state space. In this paper we also model an action as a trajectory through a state space, but we represent the actions as a sequence of temporal isolated instances, denoted primitives. These primitives are each defined by four features extracted from motion images. The primitives are recognized in each frame based on a trained classifier resulting in a sequence of primitives. From this sequence we recognize different temporal actions using a probabilistic Edit Distance method. The method is tested on different actions with and without noise and the results show recognition rates of 88.7% and 85.5%, respectively.