ppxscal/embedding_network huggingface dataset:
Random Display of Hints and Its Effect on Generating Ideas in Brain-Writing Groupware
Authors: Ujjwal Neupane, Kazushi Nishimoto, Motoki Miura, Susumu Kunifuji
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Reflecting on the results of previous experiments, we proposed methodology for effective visualization in Brain-writing groupware. This present research mainly explains the approaches that highlight the effects of visualization in Brain-writing, and the results of combining and associating idea-labels. We have proposed methodology to combat the problem of overload viewing by analyzing the individual's ability to combine, and associate idea-labels.We conduct a test with five different modes, which are all simple in structure and are very similar in theory. Test results shows that gradual display of hints, rather than package display generates better quality ideas by maintaining the cognitive stimulation of participants, as well as keep alive the demands of individuals to view and share all ideas within groups.
Environment for Collaborative Development and Execution of Virtual Laboratory Applications
Authors: Włodzimierz Funika, Daniel Harężlak, Dariusz Król, Marian Bubak
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

This paper presents the solutions for a user interface environment which have been developed within the ViroLab Virtual Laboratory to enable developers and medical researchers to develop and execute experiments. Experiments require support in form of a script editor easily extendible by a number of additional functions related to the functionality of the Virtual Laboratory, like sharing experiments, and an experiment management mechanism which enables the experiments to be executed with a number of facilities allowing, e.g. tracking the execution, logging errors. Moreover, two user groups, developers and users, need to collaborate to improve experiments and introduce more refinements to the research conducted, which imposes many requirements on the environment which becomes the main collaboration platform for the researchers. The work identifies these requirements in the domain of medical sciences and proposes solutions for efficient and convenient collaboration.
On the Relation between Multicomponent Tree Adjoining Grammars with Tree Tuples (TT-MCTAG) and Range Concatenation Grammars (RCG)
Authors: Laura Kallmeyer, Yannick Parmentier
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

This paper investigates the relation between TT-MCTAG, a formalism used in computational linguistics, and RCG. RCGs are known to describe exactly the class PTIME; simple RCG even have been shown to be equivalent to linear context-free rewriting systems, i.e., to be mildly context-sensitive. TT-MCTAG has been proposed to model free word order languages. In general, it is NP-complete. In this paper, we will put an additional limitation on the derivations licensed in TT-MCTAG. We show that TT-MCTAG with this additional limitation can be transformed into equivalent simple RCGs. This result is interesting for theoretical reasons (since it shows that TT-MCTAG in this limited form is mildly context-sensitive) and, furthermore, even for practical reasons: We use the proposed transformation from TT-MCTAG to RCG in an actual parser that we have implemented.
Developable polynomial surface approximation to smooth surfaces for fabrication parameters of a large curved shell plate by Differential Evolution
Authors: Jong Sung Yoon, Cheolho Ryu, Jang Hyun Lee
Venue: Computer-Aided Design (2008)

This paper presents a simple and efficient method to approximate a developable surface to a compound design surface by a polynomial. It is required to predict a final shape of roll bending in the fabrication of a curved shell plate. The roll bending process usually makes the cylindrical or conical curvature from an initial flat plate. It means that the final shape is developable or the surface representation has zero Gaussian curvature. The fabrication shape is important in order to estimate process parameters of roller bending. An optimization problem is formulated to determine the polynomial surface which is in the closest proximity to the design surface or the given shell plate, which is subjected to developability. The results and the efficiency of this algorithm are verified and evaluated by applying it to some shell plates which are obtained from a real ship model. The predicted bending shape becomes fundamental information in determining more process parameters for the fabrication of a compound curved shell plate.
Applying Case-Based Reasoning and Expert Systems to Coastal Patrol Crime Investigation in Taiwan
Authors: Chung C. Chang, Kuo H. Hua
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

Enhanced decision-making quality of crime investigation can ensure effective implementation of a nation's law-enforcement tasks across the board and contribute positively to its overall security and development. This study proposes the idea of applying case-based reasoning (CBR) and experts systems (ES) in conjunction with computer-assisted instruction (CAI) to crime investigation. It delves into illegal smuggling of immigrants in coastal patrol for case studies. Ocean territory law enforcement is the cornerstone of national security. Effective ocean territory law enforcement helps enhance overall national security and development. This study takes issues regarding illegal smuggling of immigrants found in coastal patrol as subject of case studies. It classifies and analyzes patterns of illegal smuggling for the purpose of establishing a crime investigation system (CIS) against illegal smuggling.
Learning in a High Dimensional Space: Fast Omnidirectional Quadrupedal Locomotion
Authors: Matthias Hebbel, Walter Nistico, Denis Fisseler
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

This paper presents an efficient way to learn fast omnidirectional quadrupedal walking gaits. We show that the common approaches to control the legs can be further improved by allowing more degrees of freedom in the trajectory generation for the legs. To achieve good omnidirectional movements, we suggest to use different parameters for different walk requests and interpolate between them. The approach has been implemented for the Sony Aibo and used by the GermanTeam in the Four-Legged-League in 2005. A standard learning strategy has been adopted, so that the optimization process of a parameter set can be done within one hour, without human intervention. The resulting walk achieved remarkable speeds, both in pure forward walking and in omnidirectional movements.
Design and analysis of a one-step addressing protocol for ad hoc networks
Authors: Hamed Nassar, Hassan Al-Mahdi, Magdi El-Gabali, Safa Abdul Aziz
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

A Mobile Ad Hoc Network (MANET) consists of a set of identical mobile nodes communicating with each other via wireless links. A mobile device in a MANET must be auto-configured before it may participate in a communication session. Several auto-configuration protocols for assigning an IP address have been proposed but there is still need for improvement. In this paper, we present a new address auto-configuration protocol called one-step addressing (OSA) protocol. This protocol generates less latency and communication overhead for assigning an IP address than previous protocols. An analytical model to investigate the performance of OSA is presented. We compare this performance with that of the token-based and the logical hierarchical addressing (LHA) protocols. The numerical results show that the OSA protocol exhibits better performance, in particular lower latency and communications overhead.
Knowledge Assessment for Annotation Techniques on Medical eLearning Objects
Authors: Dorian Gorgan, Teodor Stefanut
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

The graphics annotation is an interaction technique through which the teachers and the students may enhance the visual communication based on free expression forms, practical and artistic ability, imagination, and creativity. This paper explores the knowledge assessment techniques based on the 3D annotations. A few cases are exemplified on the medical elearning objects.
A Method for Evaluation of Compromise in Multiple Criteria Problems
Authors: Henryk Piech, Pawel Figat
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

A graphical method for the modeling of compromise in multiple criteria problems solution is proposed. The method is based on the analysis of the strategic games characteristics and takes into account both the players cooperation for the compromise solution searching and the influence of rejection of the better solutions in favor of the compromise ones. The visualization of the considered problem is based on triangle type representation of the local criteria and can be realized both in deterministic and interval or fuzzy versions. The methodology for building the models of compromise based on the comparative analysis of possible solutions is proposed. In comparison with the approaches based the on the polygon method in games theory [32], our proposition is evidently less algorithmic complex and seems as more suitable for the comparative analysis. Its usefulness becomes especially apparent is the case of small number of local criteria.
Expressing OLAP operators with the TAX XML algebra
Authors: Marouane Hachicha, Hadj Mahboubi, Jérôme Darmont
Venue: Proceedings of the 2008 EDBT workshop on Database technologies for handling XML information on the web (2008)

With the rise of XML as a standard for representing business data, XML data warehouses appear as suitable solutions for Web-based decision-support applications. In this context, it is necessary to allow OLAP analyses over XML data cubes (XOLAP). Thus, XQuery extensions are needed. To help define a formal framework and allow much-needed performance optimizations on analytical queries expressed in XQuery, having an algebra at one's disposal is desirable. However, XOLAP approaches and algebras from the literature still largely rely on the relational model and/or only feature a small number of OLAP operators. In opposition, we propose in this paper to express a broad set of OLAP operators with the TAX XML algebra.
Metric Learning: A Support Vector Approach
Authors: Nam Nguyen, Yunsong Guo
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

In this paper, we address the metric learning problem utilizing a margin-based approach. Our metric learning problem is formulated as a quadratic semi-definite programming problem (QSDP) with local neighborhood constraints, which is based on the Support Vector Machine (SVM) framework. The local neighborhood constraints ensure that examples of the same class are separated from examples of different classes by a margin. In addition to providing an efficient algorithm to solve the metric learning problem, extensive experiments on various data sets show that our algorithm is able to produce a new distance metric to improve the performance of the classical K-nearest neighbor (KNN) algorithm on the classification task. Our performance is always competitive and often significantly better than other state-of-the-art metric learning algorithms.
An Efficient e-Commerce Fair Exchange Protocol That Encourages Customer and Merchant to Be Honest
Authors: Abdullah Alaraj, Malcolm Munro
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

A new e-Commerce fair exchange protocol is presented in this paper. The protocol is for exchanging payment with digital product (such as computer software) between customer (C) and merchant (M). It makes use of Trusted Third Party (TTP) but its use is kept to minimum when disputes arise. In this respect it is an optimistic fair exchange protocol. A new idea, in which if the parties are willing to exchange then they are encouraged to be honest, is originated in this protocol. The protocol has the following features: (1) It comprises four messages to be exchanged between C and M in the exchange phase; (2) It guarantees strong fairness for both C and M so that by the end of executing the protocol both C and M will have each other's items or no one has got anything; (3) It allows both parties (C and M) to check the correctness of the item of the other party before they send their item; (4) It resolves disputes automatically online by the help of the Trusted Third Party (TTP); and (5) The proposed protocol is efficient in that it has a low number of modular exponentiations (which is the most expensive operations) when compared to other protocols in the literature.
An Ancient Graphic Documents Indexing Method Based on Spatial Similarity
Authors: Ali Karray, Jean-Marc Ogier, Slim Kanoun, Mohamed Adel Alimi
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

Content based image retrieval using spatial image content (i.e. using multiple regions and their spatial relationships) is still an open problem which has received considerable attention in literature. In this paper we introduce a new representation of image based on the most general spatial image content representation that is Attributed Relation Graphs (ARG) representation and also a new method of image indexation. Like all CBIR systems, the one proposed here has two components: a segmentation component and a matching component using a novel inexact graph matching algorithm. We tested our work in lettrines image but it's also valid in general image.
LBS Position Estimation by Adaptive Selection of Positioning Sensors Based on Requested QoS
Authors: Renato Filjar, Lidija Bušić, Saša Dešić, Darko Huljenić
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

With increasing attractiveness of location-based services (LBS), the need for consistent establishment and deployment of the LBS Quality of Service (QoS) hierarchy is strongly demanded. The position estimation is in the heart of every location-based service. Thus, LBS QoS is primarily concerned with position estimation performance, including position estimation errors and response time, achieved by either single position sensor, or a combination of several position estimation sensors and methods. Common LBS QoS establishment approach consists of either "as-is" (i. e. no-guarantee) or "best-effort" (again no-guarantee, but with some concern) approach. The proposed new solution starts with generic description of LBS QoS and methods for its deployment. As the result a method emerges that utilises position estimation by adaptive selection of positioning sensors based on requested QoS.
Multilateral Secure Cross-Community Reputation Systems for Internet Communities
Authors: Franziska Pingel, Sandra Steinbrecher
Venue: Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business (2008)

The Internet gives people various possibilities to interact with each other. Many interactions need trust that interactors behave in a way one expects them to do. If people are able to build reputation about their past behaviour this might help others to estimate their future behaviour. Reputation systems were designed to store and manage these reputations in a technically efficient way. Most reputation systems were designed for the use in single Internet communities although there are similarities between communities. In this paper we present a multilateral secure reputation system that allows to collect and use reputation in a set of communities interoperable with the reputation system. We implemented our system for the community software phpBB.
An architecture for TV content distributed search and retrieval using the MPEG query format (MPQF)
Authors: Rubén Tous, Anna Carreras, Jaime Delgado, Giovanni Cordara, Francini Gianluca, Enric Peig
Venue: Proceedings of the 2008 Ambi-Sys workshop on Ambient media delivery and interactive television (2008)

Traditional broadcasting of TV contents begins to coexist with new models of user aware content delivery. The definition of interoperable interfaces for precise content search and retrieval between the different involved parties is a requirement for the deployment of the new audiovisual distribution services. This paper presents the design of an architecture based on the MPEG Query Format (MPQF) for providing the necessary interoperability to deploy distributed audiovisual content search and retrieval networks between content producers, distributors, aggregators and consumer devices. A service-oriented architecture based on Web Services technology is defined. This paper also presents how the architecture can be applied to a real scenario, the XAC (Xarxa IP Audiovisual de Catalunya, Audiovisual IP Network of Catalonia). As far as we know, this is the first paper to apply MPQF to TV Content Distributed Search and Retrieval.
Fault Attacks on Public Key Elements: Application to DLP-Based Schemes
Authors: Chong Hee Kim, Philippe Bulens, Christophe Petit, Jean-Jacques Quisquater
Venue: Proceedings of the 5th European PKI workshop on Public Key Infrastructure: Theory and Practice (2008)

Many cryptosystems suffer from fault attacks when implemented in physical devices such as smart cards. Fault attacks on secret key elements have successfully targeted many protocols relying on the Elliptic Curve Discrete Logarithm Problem (ECDLP), the Integer Factorization Problem (IFP) or the Discrete Logarithm Problem (DLP). More recently, faults attacks have also been designed against the public key elements of ECDLP and IFP-based schemes.In this paper, we present the first fault attacks on the public key elements of DSA and ElGamal, two DLP-based signature schemes. Our attacks fully recover a 160-bit DSA secret key and a 1024-bit ElGamal secret key with ~4 ·107 and ~3 ·106 faulty signatures respectively. Such figures might suggest that DLP-based schemes are less prone to fault attacks than ECDLP- and IFP-based schemes. However, the integrity of public keys should always be checked in order to thwart such attacks since improvements may reduce the required amount of faulty signatures in the near future.
Assurance of adaptation in distributed systems
Authors: Sandeep S. Kulkarni
Venue:  (2007)

Software systems need to adapt due to changing requirements or changing environment conditions. For long-running and safety-critical applications it is highly desirable to adapt the system without completely stopping the system. In the case of distributed systems, adaptation often requires changes to multiple processes. Typically, such adaptation is performed by dynamically adding or removing components from multiple processes. As a result, during adaptation, the system may consist of both changed and unchanged processes, causing the old and the new components to overlap. This overlapping of components during adaptation may induce cross-component communication, which may lead to unpredictable and/or undesirable behavior during adaptation.In order to gain confidence in adaptation in distributed systems, in this dissertation, we address the assurance requirements at various stages of adaptation development: (i) modeling and verification of adaptation, (ii) testing of adaptation, (iii) design of components involved in adaptation, and (iv) design of a framework that supports adaptation.In this dissertation, we describe an approach based on adaptation lattices to model and verify adaptation. Specifically, we present transitional-invariant lattices and transitional-faultspan lattices to verify the correctness of adaptation in absence and presence of faults, respectively. Furthermore, we identify the issues that arise in an important class of adaptation, namely, mixed-mode adaptation. Mixed-mode adaptation allows the changed and the unchanged processes to interact during adaptation, thereby, minimizing service interruption time and communication overhead. In this dissertation, we identify and address the challenges involved in mixed-mode adaptation. Specifically, we show how the adaptation lattice approach can be used in the case of mixed-mode adaptation. We also discuss an approach for testing adaptation in distributed systems. We show how the existing approaches based on predicate detection for testing distributed systems can be extended for testing adaptation. We also describe component family design to build a library of adaptive components. One aspect of the design is to build an adaptation-verified library of components in which not only the components but also the adaptations between the components are verified. The design applies the principle of separation of concerns to separate adapt-active parts of the components from their core functionality. Furthermore, the component family design integrates the framework that performs adaptation while ensuring that the adaptation logic is separate from the core functionality of components as well as the application.
The First Seven Years of Polish Digital Computers
Authors: R. W. Marczynski
Venue: IEEE Annals of the History of Computing (1980)

During the 1950s and 1960s the Group for Mathematical Apparatus of the Mathematical Institute in Warsaw designed and built several digital computers. This paper discusses the increasing complexity and sophistication of the Polish computers as they were developed.
A General Architecture for Connecting NLP Frameworks and Desktop Clients Using Web Services
Authors: René Witte, Thomas Gitzinger
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

Despite impressive advances in the development of generic NLP frameworks, content-specific text mining algorithms, and NLP services, little progress has been made in enhancing existing end-user clients with text analysis capabilities. To overcome this software engineering gap between desktop environments and text analysis frameworks, we developed an open service-oriented architecture, based on Semantic Web ontologies and W3C Web services, which makes it possible to easily integrate any NLP service into client applications.