ppxscal/embedding_network huggingface dataset:
Proceedings of the fourth international conference on Communities and technologies
Venue: Communities and Technologies (2009)

We are delighted to welcome the Fourth International Conference on Communities and Technologies: Communities and Technologies 2009 (C&T 2009) to the College of Information Sciences and Technology (IST) of the Pennsylvania State University. In an increasingly networked world, the concept of community has taken on new meanings and inspired the development of a wide range of technologies aimed at forging connections, improving communication, and enabling coordination among groups of people. Concepts and tools such as community networks, virtual community, blogging, podcasting, social networking sites, and smart mobs have become commonplace, yet each represents a complex system of hardware, software, and people, shaped by perceptions, norms, rules, and habits, and occurring within varied social and cultural settings. It is clear that successful outcomes for information and communication technologies depend upon our understanding how these technologies interact with and can effectively support dynamic human communities. This is no small endeavor. The Communities and Technologies biennial international conference serves as a forum for stimulating and disseminating research on the complex connections between communities -- both physical and virtual -- and information and communication technologies. Researchers, designers, educators, and students from the many disciplines and perspectives bearing on the interaction between community and technology contribute to this conference. These areas include anthropology, art and architecture, business, cognitive science, communication studies, community informatics, computer science, design studies, education, ergonomics, geography, graphic design, human-computer interaction, information science, information systems, industrial engineering, interaction design, journalism, knowledge management, law, learning science, linguistics and semiotics, management, psychology, requirements engineering, sociology, software engineering, technical communication, and user experience design. The conference program for C&T 2009 includes competitively selected, peer-reviewed papers, as well as workshops, tutorials, a doctoral consortium, and invited speakers.
The multimodal presentation dashboard
Authors: Michael Johnston, Patrick Ehlen, David Gibbon, Zhu Liu
Venue: Proceedings of the Workshop on Bridging the Gap: Academic and Industrial Research in Dialog Technologies (2007)

The multimodal presentation dashboard allows users to control and browse presentation content such as slides and diagrams through a multimodal interface that supports speech and pen input. In addition to control commands (e.g. "take me to slide 10"), the system allows multimodal search over content collections. For example, if the user says "get me a slide about internet telephony," the system will present a ranked series of candidate slides that they can then select among using voice, pen, or a wireless remote. As presentations are loaded, their content is analyzed and language and understanding models are built dynamically. This approach frees the user from the constraints of linear order allowing for a more dynamic and responsive presentation style.
Traveling Wave Solutions in a One-Dimension Theta-Neuron Model
Authors: Guoguang Wen, Yongguang Yu, Zhaoxia Peng, Wei Hu
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

This paper mainly investigates traveling wave solutions in a one dimension theta-neuron model. We derive an analytical lower bound of synaptic coupling strength for traveling waves to exist. Using the numerical simulation methods, we verify some related results on the existence of traveling waves and its dependence on parameters, and give the solutions of traveling waves numerically. Furthermore, the change of the solutions curve of traveling wave is investigated corresponding to the variance of each parameter. Finally, there is an interesting phenomenon that the curve of the solution jumps with the increase of each parameter.
Development of an Electronic Bulletin Board: Retrieval System Reflecting Keyword Similarity and Evaluation of its Retrieving Efficiency
Authors: Takeshi Kitazawa, Masahiro Nagai, Hiroshi Kato, Kanji Akahori
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

This paper describes the development of an electronic bulletin board retrieval system “PRIUM” (Portfolio Retrieval for Investigating Useful Material) which reflects keyword similarity, and evaluation of its retrieving efficiency. We analyzed the retrieving efficiency compared with a bulletin board system. The former had elementary school students submitting questions about the first science semester without using PRIUM, and the latter semester had students using PRIUM. The findings are that elementary school students who used PRIUM could find information they wanted more easily, because PRIUM reduces the problem of pulling-up irrelevant information. In addition, it is clear that BBS computerized PRIUM tends to make elementary school students check information before they submit their question, and it is not necessary to submit the same questions which someone has already submitted before, because the posting is already readily available.
Design of fractional-order PID controller for vector-controlled induction motors
Authors: Yeong-Hwa Chang, Chun-I Wu, Hung-Wei Lin, Chang-Hung Hsu, Guan-Wei Liao
Venue: Proceedings of the 9th WSEAS international conference on Robotics, control and manufacturing technology (2009)

The main objective of this paper is to design a fractional-order PID speed controller for vector-controlled induction motors, where possible parameter variations and load disturbances are considered. The required parameters of the fractional-order PID controller can be obtained by utilizing the Matlab optimization toolbox, in which phase margin, gain-crossover frequency, high-frequency noise rejection and low-frequency disturbance rejection are the performance of concern. In addition to the simulations, a DSP/FPGA-based experimental platform is used for experiment verification. From simulation and experimental results, compared to the conventional PID controller, the proposed robust fractional-order PID controller can provide better control performance subject to parameters variations and load disturbances.
jDALMAS: A Java/Prolog Framework for Deontic Action-Logic Multi-Agent Systems
Authors: Magnus Hjelmblom, Jan Odelstad
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

A norm-regulated Deontic Action-Logic Multi-Agent System (DALMAS) is regulated by a normative system consisting of norms, which are expressed in an algebraic notation based on the Kanger-Lindahl theory of normative positions. A general-level Prolog implementation of the abstract DALMAS architecture makes it possible to implement specific systems in Prolog. This work describes jDALMAS, a Java library that may be used to create DALMAS applications in Java. A jDALMAS application has a client/server architecture, where a Prolog implementation of a specific system acts as a logic server. Together, the general-level Prolog implementation and the jDALMAS packages offer a framework for implementation of specific systems. Two examples of such implementations are presented here.
Mobile Agent Implemented Grid Resource Reservation
Authors: Wandan Zeng, Guiran Chang, Dengke Zhang, Yu Guo
Venue: Proceeding of the 2005 conference on Self-Organization and Autonomic Informatics (I) (2005)

It is a challenge to achieve the end-to-end QoS assurance for Grid applications in the dynamic and complex Grid environment. A Grid resource reservation model is proposed in this paper. The mobile agent implemented method of the model is given. The simulation environment of it is designed and implemented under RSVP/ns on linux. The result of simulations shows that it can flexibly adapt to the changing of the environment and achieve better end-to-end QoS assurance both of computing resources and network resources in Grid than the traditional way.
Compact complex surfaces and constant scalar curvature kahler metrics
Authors: Claude Lebrun
Venue:  (2007)

In the thesis, I prove the following statement: Every compact complex surface with even first Betti number is deformation equivalent to one which admits an extremal K&auml;hler metric. In fact, this extremal K&auml;hler metric can even be taken to have constant scalar curvature in all but two cases: the deformation equivalence classes of the blow-up of P 2 at one or two points. The explicit construction of compact complex surfaces with constant scalar curvature K&auml;hler metrics in different deformation equivalence classes is given. The main tool repeatedly applied here is the gluing theorem of C. Arezzo and F. Pacard which states that the blow-up/resolution of a compact manifold/orbifold of discrete type, which admits cscK metrics, still admits cscK metrics.
A fast k-means clustering algorithm using cluster center displacement
Authors: Jim Z. C. Lai, Tsung-Jen Huang, Yi-Ching Liaw
Venue: Pattern Recognition (2009)

In this paper, we present a fast k-means clustering algorithm (FKMCUCD) using the displacements of cluster centers to reject unlikely candidates for a data point. The computing time of our proposed algorithm increases linearly with the data dimension d, whereas the computational complexity of major available kd-tree based algorithms increases exponentially with the value of d. Theoretical analysis shows that our method can reduce the computational complexity of full search by a factor of SF and SF is independent of vector dimension. The experimental results show that compared to full search, our proposed method can reduce computational complexity by a factor of 1.37-4.39 using the data set from six real images. Compared with the filtering algorithm, which is among the available best algorithms of k-means clustering, our algorithm can effectively reduce the computing time. It is noted that our proposed algorithm can generate the same clusters as that produced by hard k-means clustering. The superiority of our method is more remarkable when a larger data set with higher dimension is used.
Using game creation for teaching computer programming to high school students and teachers
Authors: Mohammed Al-Bow, Debra Austin, Jeffrey Edgington, Rafael Fajardo, Joshua Fishburn, Carlos Lara, Scott Leutenegger, Susan Meyer
Venue: ACM SIGCSE Bulletin (2009)

In this paper we describe a two-week residential summer game camp for rising 9th and 10th grade students and a four-week high school teacher professional development course. We present survey results that indicate our approach results in increased computer programming knowledge and self-confidence for both students and teachers. Our project aims to use a holistic game creation approach to increase student interest in computer science by directly teaching to students in a summer camp, instructing the teachers during a 4-week professional development course, and finally by supporting teachers as they use our curriculum in their high schools.
Note: Full orientability of graphs with at most one dependent arc
Authors: Hsin-Hao Lai, Ko-Wei Lih, Li-Da Tong
Venue: Discrete Applied Mathematics (2009)

Suppose that D is an acyclic orientation of a graph G. An arc of D is dependent if its reversal creates a directed cycle. Let d"m"i"n(G) (d"m"a"x(G)) denote the minimum (maximum) of the number of dependent arcs over all acyclic orientations of G. We call Gfully orientable if G has an acyclic orientation with exactly d dependent arcs for every d satisfying d"m"i"n(G)=
Fuzzy complete lattices
Authors: Qiye Zhang, Weixian Xie, Lei Fan
Venue: Fuzzy Sets and Systems (2009)

In this paper, based on L-fuzzy posets previously introduced by the third author, L-fuzzy complete lattices are defined, which are generalizations of usual complete lattices and coincide with Wagner's complete and cocomplete @W-categories enriched over the frame L, and are consequently a special kind of complete @W-lattices defined by Lai and Zhang. However, Tarski fixed-point theorem for the L-fuzzy complete lattices is proved in a different way from that by Lai and Zhang. Furthermore, some fuzzy powerset operators are suggested, they are not only generalizations of ordinary powerset operators, but also generalizations of L-valued Zadeh powerset operators, and their properties are discussed.
Shaping the future
Authors: Tom Geller
Venue: Communications of the ACM (2009)

To create shape-shifting robotic ensembles, researchers need to teach micro-machines to work together.
Benefits of Handwritten Input for Students Learning Algebra Equation Solving
Authors: Lisa Anthony, Jie Yang, Kenneth R. Koedinger
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

Building on past results establishing a benefit for using handwriting when entering mathematics on the computer, we hypothesize that handwriting as an input modality may be able to provide significant advantages over typing in the mathematics learning domain. We report the results of a study in which middle and high school students used a software tutor for algebra equation solving with either typing or handwriting as the input modality. We found that handwriting resulted in similar learning gains in much less time than typing. We also found students seem to experience a higher degree of transfer in handwriting than in typing based on performance during training. This implies that students could achieve farther goals in an intelligent tutoring system curriculum when they use handwriting interfaces vs. typing. Both of these results encourage future exploration of the use of handwriting interfaces for mathematic instruction online.
Hierarchical data management in relational systems
Authors: A. Malikov, Y. Gulevskiy, D. Parkhomenko, E. Malikova
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

Methods for hierarchical data management are suggested. Methods for optimizing data bases with hierarchical data are suggested and analyzed. Interface model between the database, containing hierarchical structure and the end-user software is suggested.
Plenary lecture III: from the real world to models and paradigms in parallel scientific computing
Authors: Ion Carstea
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

The people are not isolated actors on the world scene. They enter in competition and co-operation. This real scenario is the basis of the parallel computing and finally, the basis of the parallel computers. The work in the team with the principal characteristics, the co-operation and the collaborative competition, is an education model. Cooperation and collaborative competition must be the basis of the educational process from universities, aspects that are often ignored in educational politics from Romania. The nature models are the starting points in many human projects like the parallel processing of data. The nature models must be the starting points of the educational process with emphasis on the inter-human relations. The real world offers a lot of models and paradigms for engineers in the area of the computer science and engineering. In a high- performance education we can not ignore the large computing power of the advanced computers as the parallel computers. To ignore the high-level information technology is an anti-social act in any university. Unfortunately, many professors are the slaves of an old-fashioned mode of understanding the education in engineering. It is not a good practice to solve a problem in any way; we must solve a problem with a good performance in terms of the limited physical and abstract resources of the world. An extrapolation of this idea can be done for computers where the physical resources and the abstract resource (as the processing time) are of the great importance for the engineers. We shall present some models and paradigms in parallel scientific computing starting from the real world models. The old Latin concept divide et impera is a good approach for the development of large engineering projects, for analysis and synthesis of the large-scale systems. The manager-workers paradigm is another paradigm for many parallel algorithms in engineering and business and the performance evaluation of the programs based on this paradigm is developed and presented. Engineering education from Romanian universities is analysed in context of the reconstruction process of the Romanian school. Some aspects of the politics in the area of human resources and infrastructure from universities are presented using target examples. The effects of the reform in engineering education are analysed in the context of the last decades and educational reform from Romania.
A computational framework for unsupervised analysis of everyday human activities
Authors: Aaron Bobick
Venue:  (2008)

In order to make computers proactive and assistive, we must enable them to perceive, learn, and predict what is happening in their surroundings. This presents us with the challenge of formalizing computational models of everyday human activities. For a majority of environments, the structure of the in situ activities is generally not known a priori . This thesis therefore investigates knowledge representations and manipulation techniques that can facilitate learning of such everyday human activities in a minimally supervised manner.A key step towards this end is finding appropriate representations for human activities. We posit that if we chose to describe activities as finite sequences of an appropriate set of events, then the global structure of these activities can be uniquely encoded using their local event sub-sequences. With this perspective at hand, we particularly investigate representations that characterize activities in terms of their fixed and variable length event subsequences. We comparatively analyze these representations in terms of their representational scope, feature cardinality and noise sensitivity.Exploiting such representations, we propose a computational framework to discover the various activity-classes taking place in an environment. We model these activity-classes as maximally similar activity-cliques in a completely connected graph of activities, and describe how to discover them efficiently. Moreover, we propose methods for finding concise characterizations of these discovered activity-classes, both from a holistic as well as a by-parts perspective. Using such characterizations, we present an incremental method to classify a new activity instance to one of the discovered activity-classes, and to automatically detect if it is anomalous with respect to the general characteristics of its membership class. Our results show the efficacy of our framework in a variety of everyday environments.
Implementing Analogies Using APE Rules in an Electronic Tutoring System
Authors: Evelyn Lulis, Reva Freedman, Martha Evens
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

In a corpus of eighty-one human tutoring sessions in physiology, the use of analogy to help students make correct inferences was successful 81% of the time. As a result, we are adding the most important tutor-proposed analogies that have a base in the domain to our intelligent tutoring system CIRCSIM-Tutor. We are using the APE dialogue planner because it allows for both hierarchical schemas and changes to the plan when the tutor wants to correct a student's error.
Supporting architectural design decisions through risk identification architecture pattern (RIAP) model
Authors: Thamer Al-Rousan, Shahida Sulaiman, Rosalina Abdul Salam
Venue: WSEAS Transactions on Information Science and Applications (2009)

Web projects tend to have a high possibility of loss or failure compared to traditional projects. For this reason, risk management is becoming more emphasized and systemized in Web projects so as to improve the quality of difficult decisions that normally encompass a higher level of risk exposures. Software architecture process is seen as iterative process and the amount of risk-related software architecture artifacts in each iteration of the process differ from that of other iterations. Each iteration of a process needs a unique decision-making process to accommodate certain risk factors. Since each iteration of Web project design has different types of risks in the decision-making process, a decision support system should be tailored to satisfy the specific needs of a particular iteration. In this way, various risks that arise through the life cycle of a project can be constantly checked and monitored. This research aims to support architectural design decision-making process through a risk identification architecture pattern model called RIAP. The model is anticipated to clarify high-level design process and to support active design decisions. Consequently, the software architecture becomes easier to communicate, maintain and evolve. Furthermore, it supports the analysis, improvement, and reuse of architectural design decisions process in future Web projects.
Time Acceleration Methods for Advection on the Cubed Sphere
Authors: R. K. Archibald, Katherine J. Evans, J. B. Drake, J. B. White,  Iii
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Climate simulation will not grow to the ultrascale without new algorithms to overcome the scalability barriers blocking existing implementations. Until recently, climate simulations concentrated on the question of whether the climate is changing. The emphasis is now shifting to impact assessments, mitigation and adaptation strategies, and regional details. Such studies will require significant increases in spatial resolution and model complexity while maintaining adequate throughput. The barrier to progress is the resulting decrease in time step without increasing single-thread performance. In this paper we demonstrate how to overcome this time barrier for the first standard test defined for the shallow-water equations on a sphere. This paper explains how combining a multiwavelet discontinuous Galerkin method with exact linear part time-evolution schemes can overcome the time barrier for advection equations on a sphere. The discontinuous Galerkin method is a high-order method that is conservative, flexible, and scalable. The addition of multiwavelets to discontinuous Galerkin provides a hierarchical scale structure that can be exploited to improve computational efficiency in both the spatial and temporal dimensions. Exact linear part time-evolution schemes are explicit schemes that remain stable for implicit-size time steps.
Encyclopedia of E-collaboration
Authors: Ned Kock, Ned Kock
Venue:  (2007)

E-collaboration, while having its roots in electronic technology such as telephones and other rudimentary electronic devices, has expanded dramatically with todays plethora of computer-supported cooperation and computer-mediated communication. The Encyclopedia of E-Collaboration provides the most comprehensive compilation of information on the design and implementation of e-collaboration technologies, the behavioral impacts of e-collaboration technologies on individuals and groups, and theoretical considerations on links between the use of e-collaboration technology and behavioral patterns. This cutting-edge encyclopedia delivers indispensable content to libraries and researchers looking to develop programs of investigation into the use of electronic collaboration.