ppxscal/embedding_network huggingface dataset:
Everything twitter - From Novice To Expert: The Unofficial Guide to Everything Twitter - THE BLUE BOOK
Authors: Monica Jones, Steve Soho
Venue:  (2009)

EVERYTHING TWITTER - The Unofficial Guide to Everything twitter. A Beginners Guide into the World of Twitter. ### Chapters include: A detailled Introduction to Twitter, How to Get Started with Twitter, The Secrets How To Get More Followers, The 5-Step Twitter Starter Program, A River of Uselessfulness, Awesome Twitter Ranking Websites, The 50 Most Popular Twitter Users, Twitters #followfriday Social Convention, The Official Twitter Shortcut Text Commands, How to Search and Find People, The Twitter "Dictionary", The Best Twitter Tools and 3rd party Websites, Twitter on Your Mobile Phone or Mobile Device, Where to find Free Designs and Graphics, How to add Twitter to your Website and Blog, and much more! ## This edition is the Black & White Edition. ##
Measuring Usability via Biometrics
Authors: Anjali Phukan
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

This paper reviews some exploratory research focused on developing a usability methodology based on objective biometrics computing using physiological data (ECG, respiration, and GSR sensors, as well as an infrared eye tracker) as well as behavior data (mouse and keystroke input). Following a high level literature review, various biometrics are discussed with the goal of motivating further study into the development of a methodology for usability testing, including the assessment of user satisfaction. Lessons learned and suggestions for future work were also discussed.
Insight into Goal-Directed Movements: Beyond Fitts' Law
Authors: Karin Nieuwenhuizen, Dzmitry Aliakseyeu, Jean-Bernard Martens
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Various methods and measures have been developed to assess the quality of input devices and interaction techniques. One approach to investigating the performance of input devices and interaction techniques is to focus on the quality of the produced movements. The current paper proposes a new method of analyzing goal-directed movements by dividing them into meaningful phases. In addition to the proposed analysis method a selection of measures is suggested to assess different aspects of rapidly aimed movements. In order to evaluate the added value of the proposed analysis method an experiment has been conducted to compare two input devices (mouse versus stylus with tablet) with respect to their performance on a multi-directional pointing task. The results show that the analysis into several phases reveals clear differences in the movement strategy.
Research on Cast-Rolling Model in Twin-Roll Continuous Strip Casting
Authors: Guangming Zhu, Zheng Chang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Combining classic rolling and casting theory and finite element method(FEM), a rolling force controlling model has been deduced in twin-roll strip casting, which considers the influence of casting velocity and melt level. After accuracy certification, the model has high precision under given conditions, and it can be used to set initial parameters before strip casting and can be used to adjust correlative parameters quickly during strip casting.
Performance analysis of multi-echelon supply chain network through new DSS optimiser
Authors: Rajeshwar S. Kadadevaramath
Venue: International Journal of Computer Applications in Technology (2009)

Network modelling becomes more complex as the dimensions and scope of the supply chain expand. Uncertainties in the supply chain usually increase the variance of profit or cost to the company, increasing the likelihood of total supply chain cost. Demand uncertainty and constraints posed by every echelon are important factors to be considered in the supply chain design operations. This paper specifically deals with the modelling and optimisation of a three echelon supply chain network using new optimisation tool, the particle swarm optimisation algorithm, which acts as collaborative design and manufacturing and distribution optimisation tool and essentially involves decision-making processes that require rigorous evaluation, comparison and selection of design and manufacturing solution alternatives and optimisation from a global perspective. Increasing design and manufacturing and distribution knowledge and supporting better collaborations among supply chain agents&#47;partners to make intelligent decisions can result in higher profits to the organisations.
Unsupervised discovery of a statistical verb lexicon
Authors: Trond Grenager, Christopher D. Manning
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

This paper demonstrates how unsupervised techniques can be used to learn models of deep linguistic structure. Determining the semantic roles of a verb's dependents is an important step in natural language understanding. We present a method for learning models of verb argument patterns directly from unannotated text. The learned models are similar to existing verb lexicons such as VerbNet and PropBank, but additionally include statistics about the linkings used by each verb. The method is based on a structured probabilistic model of the domain, and unsupervised learning is performed with the EM algorithm. The learned models can also be used discriminatively as semantic role labelers, and when evaluated relative to the PropBank annotation, the best learned model reduces 28% of the error between an informed baseline and an oracle upper bound.
HCI Professional Involvement in k-12 Education: On Target or Missing the Mark?
Authors: Martin Jelin, Adrian Sudol, Jeffrey Damon, Douglas Mccadden, David Brown
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

Abstract. The state of learning across geographic, socioeconomic, age, and gender boundaries can be enhanced greatly by Human-Computer Information (HCI) infusion into blended learning [1][2][3] or Course Management System (CMS) software [4][3][5]. The major thrust of this paper is to examine problematic issues examined in popular software such as MoodleTM in which the HCI community could be beneficial. By regarding the ultimate students' goal, i.e. grades, and the desirable benefit of course material understanding, one can develop an understanding of what CMS software needs and CMS software users expect on the high school level.
Particle Swarm Optimization of Ceramic Roller Kiln Temperature Field Uniformity Using Computational Fluid Dynamics Tools
Authors: Wenbi Rao, Peng Li
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

In this paper ceramic roller kiln temperature field uniformity is mainly researched using computational fluid dynamics tools and particle swarm optimization (PSO). In consideration of burning and burning temperature control is key technique of burning regime, in order to produce quality product, it is very important to get the correct ceramic kiln design parameters by simulation model computation. The relationship between ceramic roller kiln simulation model building parameters and temperature field uniformity is preliminary researched in this paper, and particle swarm optimization is used based on the result of research and some feasible conclusion is draw for the peer review.
Setting Up a Cross-Disciplinary Design Space for E-Learning Application Development
Authors: Chris Stary
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

Learner-centered design of e-learning environments provides potential for improving learning processes. Its underlying paradigm, constructivism, has not been exploited and implemented fully so far. It is still difficult to transfer specific experiences and developments from one case to another. To apply effectively constructivism to e-learning, developers need a generic design space guiding them in the translation of respective principles to features for interaction. This contribution reviews relevant inputs from e-learning and learning sciences with respect to representing domain knowledge and designing interactive learning processes. For the development of e-learning environments a structured design space capturing and relating different layers of abstraction and design dimensions is proposed. Intended for users and developers, it supports the generation and transformation of constructivist design elements to implementation components. In particular, it allows tracing and pro-active reflection for various target groups, as it can be accessed from both, a conceptual, and an implementation-oriented perspective.
Morpho-syntactic clues for terminological processing in Serbian
Authors: Goran Nenadić, Irena Spasić, Sophia Ananiadou
Venue: Proceedings of the 2003 EACL Workshop on Morphological Processing of Slavic Languages (2003)

In this paper we discuss morpho-syntactic clues that can be used to facilitate terminological processing in Serbian. A method (called srCe) for automatic extraction of multiword terms is presented. The approach incorporates a set of generic morpho-syntactic filters for recognition of term candidates, a method for conflation of morphological variants and a module for foreign word recognition. Morpho-syntactic filters describe general term formation patterns, and are implemented as generic regular expressions. The inner structure together with the agreements within term candidates are used as clues to discover the boundaries of nested terms. The results of the terminological processing of a textbook corpus in the domains of mathematics and computer science are presented.
Community sensor grids: virtualization for sharing across domains
Authors: Amiya Bhattacharya, Meddage S. Fernando, Partha Dasgupta
Venue: Proceedings of the First Workshop on Virtualization in Mobile Computing (2008)

Wireless sensor networks have been traditionally designed to be privately owned and used. Hence the two hallmark features of sensor networks, namely customized network applications and the collaborative in-network processing, are not achievable beyond the boundary of the users' administrative domains (except for limited scope data sharing through Internet gateways). This position paper advocates a contrarian notion of sensor grid that preserves the operational continuity of the participating sensornets and yet allows controlled sharing of sensor node hardware capabilities over multiple administrative domains. This is achieved by stitching together virtualized nodes donated by participating sensornets into a transient virtual sensornet underlay, which is called a Community Sensor Grid. Possible approaches for node virtualization support are discussed for some existing sensornet OS platforms. The formation, operation and dissolution of the transient underlay are to be supported by a P2P overlay formed by the Internet gateways of participating sensornets.
Scheduling with Outliers
Authors: Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Danny Segev
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

In classical scheduling problems, we are given jobs and machines, and have to schedule all the jobs to minimize some objective function. What if each job has a specified profit, and we are no longer required to process all jobs? Instead, we can schedule any subset of jobs whose total profit is at least a (hard) target profit requirement, while still trying to approximately minimize the objective function.We refer to this class of problems as scheduling with outliers. This model was initiated by Charikar and Khuller (SODA '06) for minimum max-response time in broadcast scheduling. In this paper, we consider three other well-studied scheduling objectives: the generalized assignment problem, average weighted completion time, and average flow time, for which LP-based approximation algorithms are provided. Our main results are: For the minimum average flow time problem on identical machines, we give an LP-based logarithmic approximation algorithm for the unit profits case, and complement this result by presenting a matching integrality gap. For the average weighted completion time problem on unrelated machines, we give a constant-factor approximation. The algorithm is based on randomized rounding of the time-indexed LP relaxation strengthened by knapsack-cover inequalities. For the generalized assignment problem with outliers, we outline a simple reduction to GAP without outliers to obtain an algorithm whose makespan is within 3 times the optimum makespan, and whose cost is at most (1 + ¿) times the optimal cost.
Heterogeneous multirobot coordination with spatial and temporal constraints
Authors: Mary Koes, Illah Nourbakhsh, Katia Sycara
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

Existing approaches to multirobot coordination separate scheduling and task allocation, but finding the optimal schedule with joint tasks and spatial constraints requires robots to simultaneously solve the scheduling, task allocation, and path planning problems. We present a formal description of the multirobot joint task allocation problem with heterogeneous capabilities and spatial constraints and an instantiation of the problem for the search and rescue domain. We introduce a novel declarative framework for modeling the problem as a mixed integer linear programming (MILP) problem and present a centralized anytime algorithm with error bounds. We demonstrate that our algorithm can outperform standard MILP solving techniques, greedy heuristics, and a market based approach which separates scheduling and task allocation.
Parameter Identification of Freeway Traffic Flow Model and Adaptive Ramp Metering
Authors: Jingwen Yan
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

In this work, a modified recursive least squares parameter estimation method is used to identify the parameters of the freeway traffic flow model online. Based on the parameters identified online, adaptive control strategy is introduced to deal with the ramp metering problem. Intensive simulations show the effectiveness of the identification method and the adaptive ramp metering based on the parameters identified works well.
Subgroup Discovery in Data Sets with Multi---dimensional Responses: A Method and a Case Study in Traumatology
Authors: Lan Umek, Blaž Zupan, Marko Toplak, Annie Morin, Jean-Hugues Chauchat, Gregor Makovec, Dragica Smrke
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

Biomedical experimental data sets may often include many features both at input (description of cases, treatments, or experimental parameters) and output (outcome description). State-of-the-art data mining techniques can deal with such data, but would consider only one output feature at the time, disregarding any dependencies among them. In the paper, we propose the technique that can treat many output features simultaneously, aiming at finding subgroups of cases that are similar both in input and output space. The method is based on k-medoids clustering and analysis of contingency tables, and reports on case subgroups with significant dependency in input and output space. We have used this technique in explorative analysis of clinical data on femoral neck fractures. The subgroups discovered in our study were considered meaningful by the participating domain expert, and sparked a number of ideas for hypothesis to be further experimentally tested.
Polish equivalents of spatial at
Authors: Iwona Knaś
Venue: Proceedings of the Third ACL-SIGSEM Workshop on Prepositions (2006)

This paper explicates how English and Polish select different aspects of a spatial situation to express coincidence or proximity. Spatial relations verbalized by different senses of at in English are reflected primarily by means of w, na, przy and u in Polish. First, at is presented as conceptualizing the relation of coincidence or proximity with the whole Landmark (LM) when it is conceived as a point. Then, the Polish prepositions are investigated -- how they differ with respect to the specific part of the LM that is involved in a topological relation. Although the prepositions are available to the speakers of the respective languages to render different types of relations, their senses overlap in a complex way.
Performance of STBC PPM-TH UWB Systems with Double Binary Turbo Code in Multi-user Environments
Authors: Eun Cheol Kim, Jin Young Kim
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

The performance of space time block code (STBC) pulse position modulation-time hopping (PPM-TH) ultra-wide band (UWB) systems with double binary turbo coding is analyzed and simulated in multi-user environments. The channel model is considered as a modified Saleh and Valenzuela (SV) model which was suggested as a UWB indoor channel model by the IEEE 802.15.SG3a in July 2003. In order to apply the STBC scheme to the UWB system considered in this paper, the Alamouti algorithm for real-valued signals is employed because UWB signals with the pulse modulation have the type of real signal constellation. The system performance is evaluated in terms of bit error probability. From the simulation results, it is demonstrated that the double binary turbo coding technique offers considerable coding gain with reasonable encoding and decoding complexity. Also, it is demonstrated that the performance of the STBC-UWB system can be substantially improved by increasing the number of iterations in the decoding process for a fixed code rate. Also, it is confirmed that the double binary turbo coding and STBC schemes are very effective in increasing the number of simultaneous users for a given bit error probability requirement. The results of this paper can be applied to implement the down-link of the PPM-TH UWB system.
On the Hardness of the Border Length Minimization Problem
Authors: Vamsi Kundeti, Sanguthevar Rajasekaran
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

DNA microarray technology has proven to be an invaluable tool for molecular biologists. Microarrays are used extensively in SNP detection, genomic hybridization, alternative splicing and gene expression profiling. However the manufacturers of the microarrays are often stuck with the problem of minimizing the effects of unwanted illumination (border length minimization (BLM)) which is a hard combinatorial problem. In this paper we prove that the BLM problem on a rectangular grid is NP-hard. We also give the first integer linear programming (ILP) formulation to solve BLM problem optimally. Experimental results indicate that our ILP method produces superior results (both in runtime and cost) compared to the current state of the art algorithms to solve the BLM problem optimally.
Partial matchmaking using approximate subsumption
Authors: Heiner Stuckenschmidt
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of information integration and service discovery. A drawback of the direct use of subsumption as a matching criterion is the inability to compute partial matches and qualify the degree of mismatch. In this paper, we describe a method for overcoming these problems that is based on approximate logical reasoning. In particular, we approximate the subsumption relation by defining the notion of subsumption with respect to a certain subset of the concept and relation names. We present the formal semantics of this relation, describe a sound and complete algorithm for computing approximate subsumption and discuss its application to matching tasks.
Visualization and comparison of architecture rationale with semantic web technologies
Authors: Claudia López, Pablo Inostroza, Luiz Marcio Cysneiros, Hernán Astudillo
Venue: Journal of Systems and Software (2009)

Deciding how to operationalize non-functional requirements (NFR) is a complex task, and several formalisms have been proposed to represent design decisions and their rationale. Unfortunately, these models can become complex (even unreadable) for designs with many alternatives and/or a well-documented rationale, which makes very hard to review and compare rationale. This paper introduces a Semantic Web-based technique to visualize and compare architecture rationale, combining Softgoal Interdependency Graphs (SIGs) with ontologies reified as named graphs. Reuse of rationale is thus facilitated by allowing architects to understand rationale of previous decisions and/or projects, though automated reuse remains unfeasible until extensive automated capture rationale happens. The approach is illustrated with a case study of Contexta, a museum integration project, using Toeska/Review, a Semantic Web-based tool.
Using a geometric-based sketch recognition approach to sketch Chinese radicals
Authors: Paul Taele, Tracy Hammond
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Unlike English, where unfamiliar words can be queried for its meaning by typing out its letters, the analogous operation in Chinese is far from trivial due to the nature of its written language. One approach for querying Chinese characters involve referencing their dictionary component called radicals. This is advantageous since users would not need to know their pronunciation nor their stroke-order a requirement in other querying approaches. Currently though, sketching a character's radical for querying is an unsupported capability in existing systems. Using the geometric-based LADDER sketching language combined with the Sezgin low-level recognizer, we were able to construct an application which can first recognize handwritten sketches of Chinese radical, and then output candidate Chinese characters which contain that radical. Thus, we were able to demonstrate that a geometric-based sketch recognition approach can be used to easily build applications for recognizing symbols related to Chinese characters while having reasonable recognition rates. Unlike current image-based recognition systems, our system also maintains stroke order information of characters. Since stroke order is important in written Chinese, our system can be easily expanded for use in Chinese language education by providing visual feedback to students on correct stroke order.