ppxscal/embedding_network huggingface dataset:
Learning Algorithm for Study Support in Web Study --- Design of Prototype Model
Authors: Masahiro Ozaki, Yoshinori Adachi, Naohiro Ishii
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

In the situation that the academic standards of Japanese university students have been falling down, how to force them to learn becomes very important. We have examined how to work the self-monitor strategy to improve their learning behavior. As a result, the condition of the self-monitor strategy was obtained: it must be small class, for the learner with a good grade, the self-monitor abbreviation is established, streaming is effective, and even in the large class the effect achieves by adopting the Web study. Furthermore, to improve the effect of Web study, the followings were found to be important: to specify the deadline of home study of quizzes, to present the evaluation of learning results by absolute grading, and to present the methods and techniques of instruction message at study.
Space profiling for parallel functional programs
Authors: Daniel Spoonhower, Guy E. Blelloch, Robert Harper, Phillip B. Gibbons
Venue: ACM SIGPLAN Notices (2008)

This paper presents a semantic space profiler for parallel functional programs. Building on previous work in sequential profiling, our tools help programmers to relate runtime resource use back to program source code. Unlike many profiling tools, our profiler is based on a cost semantics. This provides a means to reason about performance without requiring a detailed understanding of the compiler or runtime system. It also provides a specification for language implementers. This is critical in that it enables us to separate cleanly the performance of the application from that of the language implementation. Some aspects of the implementation can have significant effects on performance. Our cost semantics enables programmers to understand the impact of different scheduling policies while hiding many of the details of their implementations. We show applications where the choice of scheduling policy has asymptotic effects on space use. We explain these use patterns through a demonstration of our tools. We also validate our methodology by observing similar performance in our implementation of a parallel extension of Standard ML.
Componentwise Complementary Cycles in Almost Regular 3-Partite Tournaments
Authors: Zhihong He, Guojun Li, Dawei Ding, Quanhui Liu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

The vertex set of a digraph D is denoted by V(D). A c-partite tournament is an orientation of a complete c-partite graph. Let V 1,V 2,...,V c be the partite sets of D. If there exist two vertex disjoint cycles C and C¿ in D such that V i ¿ (V(C) ¿ V(C¿)) ¿ ¿ for all i = 1,2,..., c, then D is cycle componentwise complementary. The global irregularity of D is defined by $i_{\mathrm{g}}(D)=\max\{\max(d^{+}(x),d^{-}(x))-\min(d^{+}(y),d^{-}(y))|x,y\in V(D)\}$ over all vertices x and y of D (x = y is admissible), where d + (x) and d ¿(x) are the outdegree and indegree of x, respectively. If i g(D) ≤ 1, then D is almost regular. In this paper, we consider a special kind of multipartite tournaments which are almost regular 3-partite tournaments, and we show that each almost regular 3-partite tournament D is cycle componentwise complementary, unless D is isomorphic to D 3,2.
A (Second) Preimage Attack on the GOST Hash Function
Authors: Florian Mendel, Norbert Pramstaller, Christian Rechberger
Venue: Fast Software Encryption: 15th International Workshop, FSE 2008, Lausanne, Switzerland, February 10-13, 2008, Revised Selected Papers (2008)

In this article, we analyze the security of the GOST hash function with respect to (second) preimage resistance. The GOST hash function, defined in the Russian standard GOST-R 34.11-94, is an iterated hash function producing a 256-bit hash value. As opposed to most commonly used hash functions such as MD5 and SHA-1, the GOST hash function defines, in addition to the common iterated structure, a checksum computed over all input message blocks. This checksum is then part of the final hash value computation. For this hash function, we show how to construct second preimages and preimages with a complexity of about 2225 compression function evaluations and a memory requirement of about 238 bytes.First, we show how to construct a pseudo-preimage for the compression function of GOST based on its structural properties. Second, this pseudo-preimage attack on the compression function is extended to a (second) preimage attack on the GOST hash function. The extension is possible by combining a multicollision attack and a meet-in-the-middle attack on the checksum.
Model based neural control for a robotic leg
Authors: Dorin Popescu, Dan Selisteanu, Livia Popescu
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

In this paper a comparison of classical and neural control strategies for a robotic leg with two revolute joints is presented. The classical control scheme is based on a computed torque control. Better results are obtained when a model based neural control strategy is implemented. The performances of the implemented control strategies for trajectory tracking are analysed by computer simulation. If a classical controller already controls a robot leg the advantage of proposed structure is that extension to a model based neural controller for performances improvement is easy.
Mining Multidimensional Fuzzy Association Rules from a Normalized Database
Authors: Rolly Intan, Oviliani Yenty
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Mining association rules is one of the important tasks in the process of data mining application. In general, the input as used in the process of generating rules is taken from a certain data table by which all the corresponding values of every domain data have correlations one to each others as given in the data table. A problem arises when we need to generate the rules expressing the relationship between two or more domains that belong to several different tables in a normalized database. To overcome the problem, before generating rules it is necessary to join the participant tables into a general table by a process called Denormalization.. This paper shows a process of mining Multidimensional Fuzzy Association Rules from a normalized database. The process consists of two sub-process, namely sub-process of join tables (Denormalization) and sub-process of mining fuzzy rules. In general, some parts of mining the fuzzy association rules has been discussed in our previous papers [3,4,5,6].
An evolutionary approach to vehicle routing problem with dynamic time and precedence relationships
Authors: Darin Plum, Hesham H. Ali
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

When the postal service, the bus system, or trucking industry plan for their every day tasks of delivery goods or providing basic transportation needs to people, they are attempting to solve the vehicle routing problem (VRP). However, this can be a daunting task because the VRP is NP-Complete. In this paper, we will address two areas of the VRP that have been relatively unexplored by previous research, yet play an important part in real world applications of the VRP as well as define and create a genetic algorithm (GA) based on these ideas. The first area that we will address deals with the lack of real world data sets, when calculating the times between customers. This new implementation will allow the algorithm to calculate the actual time between customers at a given time of day; thus providing a final solution that is closer to a true optimal set of routes. The second addition to the VRP model will be contributed in the area of precedence relationships. These relationships often exist in real world applications and are necessary in order to help the algorithm to establish routes that are desired by the customers.
Probabilistic Neural Network Based Method for Fault Diagnosis of Analog Circuits
Authors: Yanghong Tan, Yigang He, Meirong Liu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

A novel method for fault diagnosis of analog circuits with tolerance based on wavelet packet decomposition (WP) and probabilistic neural networks (PNN) is proposed in the paper. The fault feature vectors are extracted after feasible domains on the basis of WP decomposition of responses of a circuit is solved. Then by fusing various uncertain factors into probabilistic operations, parameters and structures of PNNs for diagnose faults are obtained based on genetic optimization method leading to best detection of faults. Finally, simulations indicated that PNN classifiers can correctly 7% more than BPNN of the test data associated with our sample circuits.
On the Customization of Components: A Rule-Based Approach
Authors: Jia Zhou, Kendra Cooper, Hui Ma, I-Ling Yen
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Realizing the quality of service (QoS) requirements for a software system continues to be an important and challenging issue in software engineering. A software system may need to be updated, or reconfigured, to provide modified QoS capabilities. These changes can occur at development time or at run-time. In component based software engineering, software systems are built by composing components. When the QoS requirements change, there is a need to reconfigure the components. Unfortunately, many components are not designed to be reconfigurable, especially in terms of QoS capabilities. It is often labor-intensive and error prone work to reconfigure the components, as developers need to manually check and modify the source code. Furthermore, the work requires experienced, senior developers, which makes it costly. The limitations motivate the development of a new rule-based, semi-automated component parameterization technique that performs code analysis to identify and adapt parameters and changes components into reconfigurable ones. Compared with a number of alternative QoS adaptation approaches, the proposed rule-based technique has advantages in terms of flexibility, extensibility and efficiency. The adapted components support the reconfiguration of potential QoS trade-offs among time, space, quality, etc. The proposed rule-based technique has been successfully applied to two substantial libraries of components. The F-measure or balanced F-score results for the validation are excellent: 94%.
Reliable Discovery and Selection of Composite Services in Mobile Environments
Authors: Lucia Del Prete, Licia Capra
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

Service providers as we know them nowadays are the always-on static web service providers, that aim at Five9 availability (99.999%). Formal, or de-facto, standards, such as WSDL and BPEL, have become technology enablers for the easy discovery, use and coordination of such services. However, we envisage tomorrow's services to become increasingly pervasive, being deployed within buildings, transport systems, markets, as well as people portable devices. Such services will be, by their own nature, simple and fine grained; as a consequence, service composition will become crucial to deliver rich functionalities that satisfy end-users requests. Composing services in mobile environments opens up significant challenges. In particular, the Five9 availability assumption no longer holds: the higher the dynamic nature of the environment, the higher the chances that services will move out-of-reach before the composition completes, causing the service as a whole to fail. We argue that, in order to enable the successful completion of compound services, the reliability of the composition must be measured and reasoned about. In order to do so, we propose to dynamically deploy a prediction model to estimate the duration of colocation between componentservices. These estimates are fed in input to a service composition semantics reasoner, which then autonomically selects those providers, within the current environment, that maximise the chances of successful compound service completion. We demonstrate the positive impact that the reliability reasoning has onto the ratio of successfully completed compound services in a typical human movement scenario.
Cardiac Electrophysiology Model Adjustment Using the Fusion of MR and Optical Imaging
Authors: Damien Lepiller, Maxime Sermesant, Mihaela Pop, Hervé Delingette, Graham A. Wright, Nicholas Ayache
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

Despite important recent efforts in cardiac electrophysiology modelling, there is still a strong need for validating macroscopic models, that are well suited for diagnosis and treatment planning. In this paper we present a method to adjust the parameters of a macroscopic electrophysiology model on depolarisation and repolarisation maps obtained ex-vivo from optical imaging. With this imaging technique, optical fluorescence data are recorded with high spatial and temporal resolution on a large healthy porcine heart. A model of the myocardium is built from the MR images of the same heart, which also integrates the myocardial fibre orientation measured with DTI. We then present the first quantitative adjustment of a personalised volumetric model of the myocardium.
A Comparison of Evolvable Hardware Architectures for Classification Tasks
Authors: Kyrre Glette, Jim Torresen, Paul Kaufmann, Marco Platzner
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

We analyze and compare four different evolvable hardware approaches for classification tasks: An approach based on a programmable logic array architecture, an approach based on two-phase incremental evolution, a generic logic architecture with automatic definition of building blocks, and a specialized coarse-grained architecture with pre-defined building blocks. We base the comparison on a common data set and report on classification accuracy and training effort. The results show that classification accuracy can be increased by using modular, specialized classifier architectures. Furthermore, function level evolution, either with predefined functions derived from domain-specific knowledge or with functions that are automatically defined during evolution, also gives higher accuracy. Incremental and function level evolution reduce the search space and thus shortens the training effort.
Image-space approach to real-time realistic rendering
Authors: Sumanta Pattanaik
Venue:  (2007)

One of the main goals of computer graphics is the fast synthesis of photorealistic image of virtual 3D scenes. The work presented in this thesis addresses this goal of speed and realism. In real-time realistic rendering, we encounter certain problems that are difficult to solve in the traditional 3-dimensional geometric space. We show that using an image-space approach can provide effective solutions to these problems. Unlike geometric space algorithms that operate on 3D primitives such as points, edges, and polygons, image-space algorithms operate on 2D snapshot images of the 3D geometric data. Operating in image-space effectively decouples the geometric complexity of the 3D data from the run-time of the rendering algorithm. Other important advantages of image-space algorithms include ease of implementation on modern graphics hardware, and fast computation of approximate solutions to certain lighting calculations. We have applied the image-space approach and developed algorithms for three prominent problems in real-time realistic rendering, namely, representing and lighting large 3D scenes in the context of grass rendering, rendering caustics, which is a complex indirect illumination effect, and subsurface scattering for rendering of translucent objects.
MMAS and ACS for GPS surveying problem
Authors: Stefka Fidanova
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

Ant Colony Optimization(ACO) have been used successfully to solve hard combinatorial optimization problems. This metaheuristics method is inspired by the foraging behavior of ant colonies, which manage to establish the shortest routes between their colonies to feeding sources and back. In this paper ACO algorithms are developed to provide near-optimal solutions for Global Positioning System surveying problem. In designing Global Positioning System (GPS) surveying network, a given set of earth points must be observed consecutively (schedule). The cost of the schedule is the sum of the time needed to go from one point to another. The problem is to search for the best order in which this observation is executed. Minimizing the cost of this schedule is the goal of this work.
Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games
Authors: Neha Sugandh, Santiago Ontañón, Ashwin Ram
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time required to traverse extensive search spaces makes traditional planning techniques unsuitable. In particular, in real-time domains, past plans need to be retrieved and adapted in real time and efficient plan adaptation techniques are required. We have developed real time adaptation techniques for case based planning and specifically applied them to the domain of real time strategy games. In our framework, when a plan is retrieved, a plan dependency graph is inferred to capture the relations between actions in the plan suggested by that case. The case is then adapted in real-time using its plan dependency graph. This allows the system to create and adapt plans in an efficient and effective manner while performing the task. Our techniques have been implemented in the Darmok system (see [8]), designed to play WARGUS, a well-known real-time strategy game. We analyze our approach and prove that the complexity of the plan adaptation stage is polynomial in the size of the plan. We also provide bounds on the final size of the adapted plan under certain assumptions.
Technical communique: The regular convex cooperative linear quadratic control problem
Authors: Jacob Engwerda
Venue: Automatica (Journal of IFAC) (2008)

In this note we consider the cooperative linear quadratic control problem. That is, the problem where a number of players, all facing a (different) linear quadratic control problem, decide to cooperate in order to optimize their performance. It is well-known, when the performance criteria are positive definite, how one can determine the set of Pareto efficient equilibria for these games. In this note we generalize this result for indefinite criteria.
A 3D Web GIS System Based on VRML and X3D
Authors: Wang Ming
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Web GIS is experiencing the development from 2D system to 3D system, and the Web GIS based on VRML is the most popular form of the 3D Web GIS. By analyzing the existing Web GIS system based on VRML, this paper points out its disadvantages and introduces the next generation standard for Web3D — X3D(Extensible 3D specification). A Web GIS model based on X3D is also put forward, which has its own advantages that VRML is incomparable with: good rehostability; easy realization of big scene graphs and integration of heterogeneous database, spatial data sharing and its mutual operation etc.
Computability and Incomputability
Authors: Robert I. Soare
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

The conventional wisdom presented in most computability books and historical papers is that there were several researchers in the early 1930's working on various precise definitions and demonstrations of a function specified by a finite procedure and that they should all share approximately equal credit. This is incorrect. It was Turing alone who achieved the characterization, in the opinion of Gödel. We also explore Turing's oracle machine and its analogous properties in analysis.
A Simple Enhancement Algorithm for MR Head Images
Authors: Xiaolin Tian, Jun Yin, Yankui Sun, Zesheng Tang
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

In this paper, a simple enhancement algorithm for MR head images has been presented. The algorithm is based on histogram equalization but new adaptive reassigning rules have been involved, which approaches a non-linear gray level mapping. Comparing with other existing enhancement algorithms based on equalization, the new algorithm needs not calculate local histograms window by window but dynamically assigning new gray levels according to statistical info in related histogram, which makes the new algorithm natively faster. Testing results on different MR Head images have been reported and compared with several existing algorithms, which have shown that the new algorithm is not only faster but also reached better enhancement results.
The VLISP KIT: description implementation and evaluation
Authors: Jérôme Chailloux
Venue: Issue 3 (December 1979) (1979)

This study presents the realization of three systems VLISP (a dialect of LISP) developped at the University of Paris 8 - Vincennes, on the following machines: - a 8 bit words micro-processor (Intel8080/Zilog80) - a 16 bit words PDP-11 - a 36 bit words PDP-10 From these realizations is extracted an implementation model. Our study proposes a solution to the problems of construction and evaluation of such a system. These problems are : 1) The exhaustive description of the implementation. We propose a description based on the virtual, referential and prototype machine VCMC2. 2) The adequate representations of the VLISP objects and functions. We have associated some natural properties and we have established a functionnal typology. 3) The efficiency of the interpreter (in words of core, execution time and power). Our iterpreter does, for his own need, a optimal core allocation (in term of CONS module calls). The direct acces (which needs only one memory access) to the values of objects variable and function, and a type classification of functions allow a direct invocation of all typed functions. 4) The power of control structures. Our implementation's KIT generalizes the VLISP control structures SELF an ESCAPE, extends them with the new constructions EXIT, WHERE and LETF and unifies completly their description and implementation. An incarnation of our model is given by the realization of a complete VLISP system in the referential machine VCMC2. The full code is given in appendix.
The Evaluation of Sentence Similarity Measures
Authors: Palakorn Achananuparp, Xiaohua Hu, Xiajiong Shen
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

The ability to accurately judge the similarity between natural language sentences is critical to the performance of several applications such as text mining, question answering, and text summarization. Given two sentences, an effective similarity measure should be able to determine whether the sentences are semantically equivalent or not, taking into account the variability of natural language expression. That is, the correct similarity judgment should be made even if the sentences do not share similar surface form. In this work, we evaluate fourteen existing text similarity measures which have been used to calculate similarity score between sentences in many text applications. The evaluation is conducted on three different data sets, TREC9 question variants, Microsoft Research paraphrase corpus, and the third recognizing textual entailment data set.