ppxscal/embedding_network huggingface dataset:
Collaborative annotation for context-aware retrieval
Authors: Stefano Mizzaro, Elena Nazzi, Luca Vassena
Venue: Proceedings of the WSDM '09 Workshop on Exploiting Semantic Annotations in Information Retrieval (2009)

We discuss how collaborative annotations can be exploited to simplify and improve the management of context and resources in the context-aware retrieval field. We apply this approach to our Context Aware Browser, a general purpose solution to Web content perusal by means of mobile devices, based on the user's context. Instead of relying on a pool of experts and on a rigid categorization, as it is usually done in the context-aware field, our solution allows the crowd of users to model, control and manage the contextual knowledge through collaboration and participation. We propose two models and we outline an example of application.
Object-Oriented Finite Element Analysis to Simulate Microindentation of Thermal Sprayed MAX-phase coatings
Authors: Janna Jiang, Per Nylén
Venue: Proceedings of the 2009 International Conference on Computer Modeling and Simulation (2009)

Object-Oriented Finite element analysis (OOF) has recently been shown as an effective tool for evaluating thermo-mechanical material behaviour, because of its capability to incorporate the inherent material microstructure as an input to the model. The complexity of a thermal sprayed microstructure makes it difficult to model and simulate by classical analytical or numerical techniques and thus very appropriate for this approach. In this paper instrumented micro-indentation and meshing in the OOF program was combined with a nonlinear finite element analysis to determine elastic-plastic properties of thermal sprayed Ti2AlC coatings; the significance of the findings is discussed in this article.
Introducing PyLighter: dynamic code highlighter
Authors: Michael G. Boland, Curtis Clifton
Venue: ACM SIGCSE Bulletin (2009)

Like a screenplay, a program is both a static artifact and instructions for a dynamic performance. This duality can keep laypeople from appreciating the complexity of software systems and can be a stumbling block for novice programmers. PyLighter lets laypeople and novice programmers perceive the relationship between static Python code and its execution. PyLighter works with everything from simple console applications to arcade-style games, and because PyLighter is easy to adopt and use, instructors can integrate it into any Python-based introductory course without changing the rest of their syllabus.
A Coupling Interface Method for a Nonlinear Parabolic-Elliptic Problem
Authors: Juri D. Kandilarov
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

A coupling interface method (CIM) on uniform cartesian grid for solving parabolic-elliptic problems is proposed. The domain &Omega; is divided in two subregions &Omega; &minus; and &Omega; &thinsp;+&thinsp;. On &Omega; &minus; we consider an elliptic equation with nonlinear term and on &Omega; &thinsp;+&thinsp; - a linear parabolic equation. On the interface &Gamma; the standard transmission conditions are stated: the jumps of the solution and the flux are zero. A method of upper and lower solutions is used to deal with the nonlinearity. Numerical experiments are discussed.
Doing the LibraryThing&trade; in an academic library catalog
Authors: Christine DeZelar-Tiedman
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

Many libraries and other cultural institutions are incorporating Web 2.0 features and enhanced metadata into their catalogs (Trant 2006). These value-added elements include those typically found in commercial and social networking sites, such as book jacket images, reviews, and user-generated tags. One such site that libraries are exploring as a model is LibraryThing (www.librarything.com) LibraryThing is a social networking site that allows users to "catalog" their own book collections. Members can add tags and reviews to records for books, as well as engage in online discussions. In addition to its service for individuals, LibraryThing offers a fee-based service to libraries, where institutions can add LibraryThing tags, recommendations, and other features to their online catalog records.
The development of the reactor safety film
Authors: Nancy N. Sheheen, Patrick J. Hodson
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The first computer-generated film of LASL's Reactor Safety efforts was developed using the ANIMATE framework, a program that adds visual capabilities to MAPPER. Numerous software limitations had to be overcome within a very limited production schedule. A significant achievement was the 15,000-vector-per-frame sequence depicting a pressurized water reactor core with parts flashing while pumps circulate fluid through the system.
Distributed P2P-SIP conference construction
Authors: Karn Tirasoontorn, Sinchai Kamolphiwong, Suthon Sae-Wong
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

SIP-based Internet Telephony is an increasingly popular communication system that is used by various users and organizations. Most of deployments are based on client/server model in traditional SIP system. Especially, conferencing function is used for voice/video conference include file transfer and share remote applications through internet network. The conferencing system has an association between SIP user agents (Participants) and central point of control (Focus). The functionalities of SIP conference are organized in a centralized manner and heavily rely on dedicated servers. And it has some drawbacks to make the conferencing system is not reliable and scalable when participants increase. Peer-to-Peer (P2P) is another model different from client/server model. Every peer plays an equally important role in the network. P2P network is self-organized architecture, does not require any server in the network and hence make a good solution to those problems mentioned in above. In this paper, we describe the architecture designed to construct Peer-to-Peer (P2P) network collaborating with existing traditional SIP for conferencing system. The details in this paper include the operations of how to create, join, leave and terminate the conference in P2P-SIP conference network. We have shown that our proposed scheme compared to other recently schemes is more attractive in terms of scalability (e.g. based on pure P2P), working with traditional SIP, as well as interactive communication approach for all SIP clients and extend function join our P2P-SIP conference.
WikiSym: the conference and community for Wiki researchers and practitioners worldwide!
Authors: Martin Cleaver
Venue: Issue Spring (March 2009) (2009)

This Wednesday 25th February marks just 8 months till WikiSym 2009. Planning is underway! We alternate the conference between being located in Europe and the Americas. This year we're in fabulous Florida, Orlando to be exact, and right next to Disney World. Co-located with OOPSLA, with WikiSym starting Sunday 25th Oct 2009, and running till Tuesday; OOPSLA spans Weds to Friday. While our membership bases have become very different (OOPSLA is purely a technology conference, but WikiSym's growth means it constitutes typically only 1/3 technologists), our organizations' history means we have become good at supporting one other.
A System for Algorithms' Animation
Authors: D. Merlini, S. Petruzzi, R. Sprugnoli, M. C. Verri
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We present the prototype of an algorithm animation system, seen as a tool for teaching basic algorithms in Computer Science. An important property of our system is the active role played by the student: he/she is allowed to interact with an algorithm in order to understand its behaviour (he/she can stop it, backtrack and rerun it) and can perform exercises, proposed at random, to gain the necessary skill to reproduce the algorithm.
Optimal and distributed protocols for cross-layer design of physical and transport layers in MANETs
Authors: John Papandriopoulos, Subhrakanti Dey, Jamie Evans
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

We seek distributed protocols that attain the global optimum allocation of link transmitter powers and source rates in a cross-layer design of a mobile ad hoc network. Although the underlying network utility maximization is nonconvex, convexity plays a major role in our development. We provide new convexity results surrounding the Shannon capacity formula, allowing us to abandon suboptimal high-SIR approximations that have almost become entrenched in the literature. More broadly, these new results can be back-substituted into many existing problems for similar benefit. Three protocols are developed. The first is based on a convexification of the underlying problem, relying heavily on our new convexity results. We provide conditions under which it produces a globally optimum resource allocation. We show how it may be distributed through message passing for both rate- and power-allocation. Our second protocol relaxes this requirement and involves a novel sequence of convex approximations, each exploiting existing TCP protocols for source rate allocation. Message passing is only used for power control. Our convexity results again provide sufficient conditions for global optimality. Our last protocol, motivated by a desire of power control devoid of message passing, is a near optimal scheme that makes use of noise measurements and enjoys a convergence rate that is orders of magnitude faster than existing methods.
Insuring individual's privacy from statistical data base users
Authors: Mohammed Inam Ul Haq
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

"Privacy is the claim of individuals, groups or institutions to determine for themselves when, how and to what extent information about them can be communicated to others." The problem of privacy arises when people are asked to provide personal information either on a mandatory or voluntary basis. The persons about whom the data are collected may be apprehensive that unscrupulous individuals could gain both economic and political advantage over them through access to their personal information. Data collecting agencies often conduct surveys to collect data to use for statistical purposes. In a mandatory survey, the respondent cannot refuse to submit the data. Still, collecting agencies realize that the real foundation of reliable statistics is public cooperation and not the threat of prosecution. In a voluntary survey, the collecting agency has no power and nothing to offer but the general benefits that can accrue to the public from the information. It promises respondents that data will only be disclosed for statistical purposes. In both cases, the collecting agencies can better accomplish their aim if they can assure the respondent that their privacy will be respected. Many agencies use computers to store collected data. The computer provides a central source of information available to many different users. In addition, the information can be retrieved very quickly. However, there are many problems which are associated with the security of computerized information such as: validity of the user, clearance of system personnel and safety for masquerading, electromagnetic pick up, wiretapping, browsing, piggy back entry, etc. Even if these problems did not exist, and assuming that the collecting agencies have good intentions and intend to allow their users to ask only statistical queries about the stored data, their promises are not sufficient to guarantee that there will be no disclosure of any individual's personal information. Hoffman and Miller have shown that a user can combine the answers to some specific statistical queries and his previous knowledge about an individual's personal information to find out more about that individual. Therefore the problem considered is to determine the conditions which guarantee that a user who is allowed to ask only statistical queries cannot be successful in obtaining any more information about any individual than he already has. Before suggesting a solution to this problem, some illustrations to show how disclosure may occur and some definitions are reproduced from an earlier paper by the author.
How Efficient Can Memory Checking Be?
Authors: Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small (but trusted and secret) local storage to detect faults in the large (but public and untrusted) remote storage. A memory checker receives from the user store and retrieve operations to the large database. The checker makes its own requests to the (untrusted) remote storage and receives answers to these requests. It then uses these responses, together with its small private and reliable local memory, to ascertain that all requests were answered correctly, or to report faults in the remote storage (the public memory).A fruitful line of research investigates the complexity of memory checking in terms of the number of queries the checker issues per user request (query complexity) and the size of the reliable local memory (space complexity). Blum et al., who first formalized the question, distinguished between online checkers (that report faults as soon as they occur) and offline checkers (that report faults only at the end of a long sequence of operations). In this work we revisit the question of memory checking, asking how efficient can memory checking be?For online checkers, Blum et al. provided a checker with logarithmic query complexity in n, the database size. Our main result is a lower bound: we show that for checkers that access the remote storage in a deterministic and non-adaptive manner (as do all known memory checkers), their query complexity must be at least ¿(logn /loglogn). To cope with this negative result, we show how to trade off the read and write complexity of online memory checkers: for any desired logarithm base d, we construct an online checker where either reading or writing is inexpensive and has query complexity O(log d n). The price for this is that the other operation (write or read respectively) has query complexity O(d ·log d n). Finally, if even this performance is unacceptable, offline memory checking may be an inexpensive alternative. We provide a scheme with O(1) amortized query complexity, improving Blum et al.'s construction, which only had such performance for long sequences of at least n operations.
Organizations and Autonomous Agents: Bottom-Up Dynamics of Coordination Mechanisms
Authors: Bob Vecht, Frank Dignum, John-Jules Ch. Meyer, Virginia Dignum
Venue: Coordination, Organizations, Institutions and Norms in Agent Systems IV: COIN 2008 International Workshops, COIN@AAMAS 2008, Estoril, Portugal, May 12, 2008. COIN@AAAI 2008, Chicago, USA, July 14, 2008. Revised Selected Papers (2009)

Agents in an organization need to coordinate their actions in order to reach the organizational goals. Organizational models specify the desired behaviour in terms of roles, relations, norms and interactions. In this research, we show how organizational rules can be adopted by autonomous agents. We have developed a method to translate norms into reasoning rules for agents. However, since the agents are autonomous they will have their own reasoning rules next to the organizational rules. We propose a modular reasoning model to make organizational rules explicit. This allows for meta-reasoning about these rules. We show that this stimulates bottom-up dynamics in the organization.
Integrated Simulation and Model-Checking for the Analysis of Biochemical Systems
Authors: Federica Ciocchetta, Stephen Gilmore, Maria Luisa Guerriero, Jane Hillston
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Model-checking can provide valuable insight into the behaviour of biochemical systems, answering quantitative queries which are more difficult to answer using stochastic simulation alone. However, model-checking is a computationally intensive technique which can become infeasible if the system under consideration is too large. Moreover, the finite nature of the state representation used means that a priori bounds must be set for the numbers of molecules of each species to be observed in the system. In this paper we present an approach which addresses these problems by using stochastic simulation and the PRISM model checker in tandem. The stochastic simulation identifies reasonable bounds for molecular populations in the context of the considered experiment. These bounds are used to parameterise the PRISM model and limit its state space. A simulation pre-run identifies interesting time intervals on which model-checking should focus, if this information is not available from experimental data.
A target-driven core curriculum development
Authors: Li Zhang, Dianfu Ma, Yiming Zhou
Venue: Proceedings of the 1st ACM Summit on Computing Education in China on First ACM Summit on Computing Education in China (2008)

This paper introduces a systematic method of target-driven core curriculum development scheme, including both theory courses and laboratory practice. Based on a concrete core training target which emphasis on operability and measur-ability, we composed a have-to-know and have-to-do list for the students. After analyzing it thoroughly, we framed a teaching and learning hierarchy and spread it into 4 year courses. The method shows a better operability, measur-ability and traceability than those traditional curriculum development methods. The paper is organised as follows, the 1st section states the problem; the 2nd introduces the scheme; the 3rd provides an example of the scheme; the 4th is the conclusion and future work.
Semi-supervised Clustering for Word Instances and Its Effect on Word Sense Disambiguation
Authors: Kazunari Sugiyama, Manabu Okumura
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

We propose a supervised word sense disambiguation (WSD) system that uses features obtained from clustering results of word instances. Our approach is novel in that we employ semi-supervised clustering that controls the fluctuation of the centroid of a cluster, and we select seed instances by considering the frequency distribution of word senses and exclude outliers when we introduce "must-link" constraints between seed instances. In addition, we improve the supervised WSD accuracy by using features computed from word instances in clusters generated by the semi-supervised clustering. Experimental results show that these features are effective in improving WSD accuracy.
The J-TEXT Tokamak Control System
Authors: Zhoujun Yang, Ge Zhuang, Xiwei Hu, Ming Zhang, Shengshun Qiu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The J-TEXT tokamak is a complex experiment facility. Its running refers many subsystems, such as various power supply systems, a gas puffing system, many diagnostic systems, a safety protection system, etc. So it asks for a control system to manage the process of discharge. This paper presents the functions of control system for the J-TEXT tokamak, describes its structure, and introduces the realization based on QNX real time operating system. Results obtained demonstrate that the control system handles the discharge process perfectly. However, it will be continued to improve to meet much more requirement and get more perfect performance.
The Resting Place of Innovation
Authors: Grady Booch
Venue: IEEE Software (2009)

Successful software-intensive systems are generally quite innovative, as evidenced by their success. Although their architectures will, over time, converge to a stable point, this does not mean that innovation stops. Rather, for any such system to remain vibrant and relevant, innovation much proceed simultaneously at many levels.
New approaches for face recognition using neural networks
Authors: Omid Morad Tallab, Rasoul Morad Tallab
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

This paper propose new hybrid approaches for face recognition. Gabor wavelets representation of face images is an effective approach for both facial action recognition and face identification. Perform dimensionality reduction and linear discriminant analysis on the down sampled Gabor wavelet faces can increase the discriminant ability. Nearest feature space is extended to various similarity measures. In our experiments, proposed Gabor wavelet faces combined with extended net feature space classifier shows very good performance, which can achieve 93% maximum correct recognition rate on ORL data set without any pre-processing step.
Classification of Video Data Using Centroid Neural Network with Bhattacharyya Kernel
Authors: Dong-Chul Park
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

A novel approach for the classification of compressed video data using Centroid Neural Network with Bhattacharyya Kernel (CNN(BK)) is proposed in this paper. The proposed classifier is based on Centroid Neural Network (CNN) and also exploits advantages of the kernel method for mapping input data into a higher dimensional feature space. Furthermore, since the feature vectors of compressed video data are modelled by Gaussian Probability Density Function (GPDF), the classification procedure is performed by considering Bhattacharyya distance as the distance measure of the proposed classifier. Experiments and results on a video trace data demonstrate that the proposed classification scheme based on CNN(BK) outperforms conventional algorithms including Self-Organizing Map(SOM) and conventional CNN.
Aspect oriented programming with hidden markov models to verify design use cases
Authors: German Florez-Larrahondo, Walker Haddock
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

The goal of this research is to formulate a framework to determine whether the usage of an application in production environments is consistent with the test cases used to verify it before the application was released. Aspect-Oriented Programming (AOP) techniques are used to apply the instrumentation required for the measuring process so that the program is oblivious to the instrumentation and Hidden Markov Models (HMMs) are used to create signatures of the program. This paper presents the preliminary findings on the use of such mathematical models to measure the completeness of use cases driving the quality assurance testing. To demonstrate the technique, the Web Service API of a commercial product is used. SOAP calls executed through different client applications are used to create test data for the experiments. The HMMs signatures created from collecting method calls can be used to determine whether the application is used according to the uses cases that have been verified. If the likelihood that the stochastic model obtained during testing can generate the sequences of calls collected from the production environment (via AOP techniques) is low, then it suggests that the program is being used in a way that has not been formally tested. These experiments will show that observable differences of the measurements using log likelihood graphs can detect such anomalies.