ppxscal/embedding_network huggingface dataset:
Regularized Newton method for unconstrained convex optimization
Authors: Roman A. Polyak
Venue: Mathematical Programming: Series A and B (2009)

We introduce the regularized Newton method (rnm) for unconstrained convex optimization. For any convex function, with a bounded optimal set, the rnm generates a sequence that converges to the optimal set from any starting point. Moreover the rnm requires neither strong convexity nor smoothness properties in the entire space. If the function is strongly convex and smooth enough in the neighborhood of the solution then the rnm sequence converges to the unique solution with asymptotic quadratic rate. We characterized the neighborhood of the solution where the quadratic rate occurs.
Financial distress prediction based on serial combination of multiple classifiers
Authors: Jie Sun, Hui Li
Venue: Expert Systems with Applications: An International Journal (2009)

Financial distress is the most synthetic form of business crisis and financial distress prediction (FDP) has been a widely and continually studied topic in the field of corporate finance. Recently, the advantage of FDP based on multiple classifiers' combination began to be emphasized. This paper attempts to put forward a FDP method based on serial combination of multiple classifiers, which tries to make use of class-wise expertise of diverse base classifiers in serial combination system. Framework of serial combination system for FDP, selection mechanism of base classifiers and algorithm of FDP based on serial combination are discussed in detail. With financial condition dividing into two categories, empirical experiment indicated that FDP method based on serial combination of multiple classifiers performs at least as well as the best base classifier in average accuracy and stability, but it did not show much advantage in information complementation from base classifiers and was easy to be dominated by the first base classifier in serial combination system. This may be attributed to the number of target categories and serial combination method was inferred to be more suitable for FDP with multiple categories, which leaves to be further studied.
Elyze: enabling safe parallelism in event-driven servers
Authors: Kiran Pamnany, John Jannotti
Venue: Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2008)

It is increasingly necessary for applications to take advantage of concurrency in order to increase performance. Unfortunately, it is notoriously difficult to write correct concurrent applications as they are subject to a variety of subtle bugs that can be difficult to reproduce. We advocate an approach to developing these applications, particularly servers, in which a conservative static analysis determines when code segments may safely run in parallel, and a runtime scheduler respects these constraints, an approach that is safe by default. We have built an analyzer for event-driven servers written in C that detects unsafe data sharing between event handlers. When the analysis determines that two event handlers might access the same data, whether through a global variable or through the request-specific data structure passed to the handlers, it produces a constraint on the concurrent execution of those handlers. We are building a complementary runtime system that will use these constraints to safely run event handlers concurrently. We have analyzed thttpd, an event-driven web server, and show that our analyzer finds safe parallelism in this server, enabling increased performance without the hazards of threads and locks.
Cluster parallel rendering
Authors: Renato Pajarola
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

Continuing improvements in CPU and GPU performances as well as increasing multi-core processor and cluster-based parallelism demand for flexible and scalable parallel rendering solutions that can exploit multipipe hardware accelerated graphics. In fact, to achieve interactive visualization, scalable rendering systems are essential to cope with the rapid growth of data sets. However, parallel rendering systems are non-trivial to develop and often only application specific implementations have been proposed.
Simulating educational physical experiments in augmented reality
Authors: Hannes Kaufmann, Bernd Meyer
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

We present an augmented reality application for mechanics education. It utilizes a recent physics engine developed for the PC gaming market to simulate physical experiments in the domain of mechanics in real time. Students are enabled to actively build own experiments and study them in a three-dimensional virtual world. A variety of tools are provided to analyze forces, mass, paths and other properties of objects before, during and after experiments. Innovative teaching content is presented that exploits the strengths of our immersive virtual environment. PhysicsPlayground serves as an example of how current technologies can be combined to deliver a new quality in physics education.
Ramsey degrees of finite ultrametric spaces, ultrametric Urysohn spaces and dynamics of their isometry groups
Authors: Lionel Nguyen Van The
Venue: European Journal of Combinatorics (2009)

We study Ramsey-theoretic properties of several natural classes of finite ultrametric spaces, describe the corresponding Urysohn spaces, and compute a dynamical invariant attached to their isometry groups.
Disturbance Observer-Based Variable Structure Control on the Working Attitude Balance Mechanism of Underwater Robot
Authors: Min Li, Heping Liu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

When an underwater robot is to work under the water, the manipulator has to reach out. This can change the center of the gravity and cause the robot pitching. It’s difficult to make a maneuver for a pitched robot. An automechanism was developed to balance the pose of the robot. A sliding mode variable structure controller was designed to control the balance device, in which a disturbance observer was used to observe the disturbances. This reduced the switching-gain of the control system greatly and weakened the chattering more of course. A practical result was achieved for the control of pitch change of the robot caused by the manipulators and detecting pan/tilt and indicated the practicability of the balance device including its control approach. As the device is a single-axis system, a double-axes system is needed for the balance of pitching and rolling.
A Multiuser Detection for MC-CDMA System Based on Particle Swarm Optimization Algorithm with Hopfield Neural Network
Authors: Yin-fang Long, Zhi-jin Zhao, Lei Shen
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, we propose a multiuser detection (MUD) for MC-CDMA system based on particle swarm optimization algorithm with Hopfield neural network (HNNPSO). In the updating of particles' position, we choose some random particles as individuals composed of neurons in HNN to update the network, and employ PSO updating strategy to the others, which can provide faster rate of convergence and reduce the computational complexity of PSO algorithm. Simulation results show that the performance of the proposed MUD such as bit error rate, convergence, system capacity, and near-far resistance is better than that of MUD based on PSO and MUD based on HNN, nearly reaching the performance of optimal multiuser detection (OMD).
Differential-Algebraic Systems: Analytical Aspects and Circuit Applications
Authors: Ricardo Riaza
Venue:  (2008)

Differential-algebraic equations (DAEs) provide an essential tool for system modeling and analysis within different fields of applied sciences and engineering. This book addresses modeling issues and analytical properties of DAEs, together with some applications in electrical circuit theory. Beginning with elementary aspects, the author succeeds in providing a self-contained and comprehensive presentation of several advanced topics in DAE theory, such as the full characterization of linear time-varying equations via projector methods or the geometric reduction of nonlinear systems.Recent results on singularities are extensively discussed. The book also addresses in detail differential-algebraic models of electrical and electronic circuits, including index characterizations and qualitative aspects of circuit dynamics. In particular, the reader will find a thorough discussion of the state/semistate dichotomy in circuit modeling. The state formulation problem, which has attracted much attention in the engineering literature, is cleverly tackled here as a reduction problem on semistate models.
Plenary lecture II: adaptive wireless access solutions in transport systems management environment
Authors: Tomas Zelinka
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

This paper presents new attitude to adaptive control of the multi-path and multi-technology technology wireless access communications solutions. Presented approach is response on transport processes management requirements to provide complex seamless communication services in the selection of different modes coverage and guaranteed quality. Such solutions are related to communications of the vehicle to infrastructure as well as vehicle to vehicle. Such communications networking must include inter-vehicle communication interconnect, as well. CALM based system represent relevant data routing/switching with vertical RM OSI compatible communications architecture, however, with horizontal hierarchical management structure. Genuine decision processes in defined communications CALM routing/switching structures are, however, in literature discusses quite rarely. Decision processes measurable i.e. precisely enumerated system requirements are qualified by the performance indicators. Based on application analysis performance indicators are demarcated into the acceptable tolerance ranges. In this paper we propose decision processes based on Bayes statistics as "classical" alternative to e.g. concept of Policy-based Management (PBM) traditionally and widely applied within the IP based networks. In proposed alternative measured data are processed by Kalman filters to separate reasonable part of noise and to predict individual parameters behavior in its near future. Than self-trained classification algorithm processes filtered measured data which are combined with deterministic parameters like the services economy, company policy etc. Training data block represent parameters vectors time line extended by correct decisions, i.e. appurtenance to appropriate class. Even though these tools are designed specifically for the multi-path communications system, such principles are open for future penetration into whole telematic system adaptive management.
Precoder for Chip-Interleaved CDMA Using Space-Time Block-Coding
Authors: Yuji Kimura, Koji Shibata, Takakazu Sakai
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

We study the performances of a synchronous chip-interleaved, block spread (CIBS) code division multiple access (CDMA) with space-time block-coding (STBC) in the presence of frequency-selective fading. For providing the space diversity gain due to STBC, we introduce the optimum precoding for the STBC. Zero-forcing and minimum mean square error equalizers for CIBS-CDMA are derived. Simulation results confirm that the proposed precoder is valid under the frequency selective fading.
Using cognitive task analysis to explore issues in the procurement of intelligent decision support systems
Authors: Robert R. Hoffman, Kelly Neville, Jennifer Fowlkes
Venue: Cognition, Technology and Work (2009)

Government statistics and various news reports suggest that upwards of half of all large-scale information technology (IT) development projects fail to meet expectations for facilitating cognitive work. Many of the failures point to the neglect of human-centering considerations during the development of sociotechnical systems. The groups of people who create IT themselves constitute a sociotechnical system. Therefore, laws of cognitive work apply to the cognitive work of IT development, and these laws include the &#x201c;reductive tendency&#x201d; for people to form simplified understandings when confronted with domains of dynamics and complexity. In this article, we report a study in which we &#x201c;turned the tables&#x201d; on IT systems development. Rather than using cognitive task analysis to study some work domain for which an envisioned IT system would be developed, we used cognitive task analysis to study the work domain of IT systems development itself. Through documentation analysis and critical decision method procedures, we sought to reveal specific challenges with regard to human-centering, and ways in which principles, methods, and tools of ergonomics (human factors, cognitive systems engineering) might help the developers of IT systems better address the human and social aspects of cognitive work. The findings highlight the outstanding challenges and barriers to the procurement and development of usable, useful, and understandable IT for sociotechnical systems. Challenges include the following: the need for better coordination mechanisms; the need to locate cognitive systems engineers, as advocates for workers, in key leadership roles; the need to reconceive concepts and methods of requirements and requirements specification; and the need for better negotiation of the trade-offs of cost/schedule considerations with human-centering considerations.
Multi-domain spoken language understanding with transfer learning
Authors: Minwoo Jeong, Gary Geunbae Lee
Venue: Speech Communication (2009)

This paper addresses the problem of multi-domain spoken language understanding (SLU) where domain detection and domain-dependent semantic tagging problems are combined. We present a transfer learning approach to the multi-domain SLU problem in which multiple domain-specific data sources can be incorporated. To implement multi-domain SLU with transfer learning, we introduce a triangular-chain structured model. This model effectively learns multiple domains in parallel, and allows use of domain-independent patterns among domains to create a better model for the target domain. We demonstrate that the proposed method outperforms baseline models on dialog data for multi-domain SLU problems.
Predicting the compressive strength of ground granulated blast furnace slag concrete using artificial neural network
Authors: Cahit Bilim, Cengiz D. Atiş, Harun Tanyildizi, Okan Karahan
Venue: Advances in Engineering Software (2009)

In this study, an artificial neural networks study was carried out to predict the compressive strength of ground granulated blast furnace slag concrete. A data set of a laboratory work, in which a total of 45 concretes were produced, was utilized in the ANNs study. The concrete mixture parameters were three different water-cement ratios (0.3, 0.4, and 0.5), three different cement dosages (350, 400, and 450kg/m^3) and four partial slag replacement ratios (20%, 40%, 60%, and 80%). Compressive strengths of moist cured specimens (22+/-2^oC) were measured at 3, 7, 28, 90, and 360 days. ANN model is constructed, trained and tested using these data. The data used in the ANN model are arranged in a format of six input parameters that cover the cement, ground granulated blast furnace slag, water, hyperplasticizer, aggregate and age of samples and, an output parameter which is compressive strength of concrete. The results showed that ANN can be an alternative approach for the predicting the compressive strength of ground granulated blast furnace slag concrete using concrete ingredients as input parameters.
Implementing Thread Cancellation in Multithreaded Prolog Systems
Authors: Atef Suleiman, John Miller
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

The Prolog primitive thread_cancel/1, which simply cancels a thread as recommended in ISO/IEC DTR 13211-5:2007, is conspicuously absent in well-maintained, widely used multithreaded Prolog systems. The ability to cancel a thread is useful for application development and is critical to Prolog embeddability. The difficulty of cancelling a thread is due to the instant mapping of Prolog multithreading primitives to the native-machine thread methods. This paper reports on an attempt to implement thread cancellation using self-blocking threads. A thread blocks at the same safe execution point where the state of the underlying virtual machine is defined. A blocked thread awaits a notification to resume or terminate. A resumed thread may be redirected to self-block by a blocking primitive. Experimental results based on a prototype implementation show that using self-blocking threads not only simplifies the implementation of thread cancellation but also improves the performance of message-passing primitives.
A Light-weighted Operating System with Deadlock Prevention Strategy for Wireless Sensor Nodes
Authors: Chunping Wang, Wei Wu
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

To overcome the flaws on scheduling reliability in current operating systems for wireless sensor nodes, we presented VROS: a light-weighted and multitasking operating system based on message queue scheduling. In VROS, Message is not only used as a means of communication among tasks, but also an access method of software and hardware resources. Each resource access within a task is implemented by binding relevant messages and their data process with the task. With the resource access method, a deadlock prevention strategy is designed which is achieved by attacking the circular wait condition. The experiments on the macro benchmark of surge application show that the deadlock caused by resource competitions were effectively prevented, CPU active time in VROS was nearly identical with TinyOS and SOS, and the data transporting delay was rarely affected.
The dark side of information: overload, anxiety and other paradoxes and pathologies
Authors: David Bawden, Lyn Robinson
Venue: Journal of Information Science (2009)

This review article identifies and discusses some of main issues and potential problems - paradoxes and pathologies - around the communication of recorded information, and points to some possible solutions. The article considers the changing contexts of information communication, with some caveats about the identification of `pathologies of information', and analyses the changes over time in the way in which issues of the quantity and quality of information available have been regarded. Two main classes of problems and issues are discussed. The first comprises issues relating to the quantity and diversity of information available: information overload, information anxiety, etc. The second comprises issues relating to the changing information environment with the advent of Web 2.0: loss of identity and authority, emphasis on micro-chunking and shallow novelty, and the impermanence of information. A final section proposes some means of solution of problems and of improvements to the situation.
Translation, scaling and rotation invariant spot matching using delaunay triangulation
Authors: Ankhbayar Yukhuu, Hwang Young Sup
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Point pattern matching is one of the most powerful methods of spot identification in a gel image. We propose an algorithm to determine the matching of each point pair and its transformation parameters. The main feature of the presented solution is that we use a local point pattern matching approach using Delaunay triangulation of a point sets to find spot pairs. As a consequence, the exact position of spot pairs are determined by Delaunay triangulation and the proposed approach can handle translation, scaling and rotation differences. Our local matching algorithm can be used as a basic step to the global matching and as a landmark setting.
Harmony K-means algorithm for document clustering
Authors: Mehrdad Mahdavi, Hassan Abolhassani
Venue: Data Mining and Knowledge Discovery (2009)

Fast and high quality document clustering is a crucial task in organizing information, search engine results, enhancing web crawling, and information retrieval or filtering. Recent studies have shown that the most commonly used partition-based clustering algorithm, the K-means algorithm, is more suitable for large datasets. However, the K-means algorithm can generate a local optimal solution. In this paper we propose a novel Harmony K-means Algorithm (HKA) that deals with document clustering based on Harmony Search (HS) optimization method. It is proved by means of finite Markov chain theory that the HKA converges to the global optimum. To demonstrate the effectiveness and speed of HKA, we have applied HKA algorithms on some standard datasets. We also compare the HKA with other meta-heuristic and model-based document clustering approaches. Experimental results reveal that the HKA algorithm converges to the best known optimum faster than other methods and the quality of clusters are comparable.
Cooperative Intrusion Detection Model Based on State Transition Analysis
Authors: Shaohua Teng, Wei Zhang, Xiufen Fu, Naiqi Wu
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Many intrusion behaviors can be characterized as the execution of a sequence of crucial commands that results in an unauthorized access. Lots of attack sequences can be derived by either exchanging properly orders of crucial commands or replacing crucial commands with the functionally similar commands, which have the same performance. Therefore, it is very difficult to detect such attacks. In this paper, we propose a cooperative intrusion detection model based on state transition analysis, in which the topological order and isomorphic transformation are adopted. For a given sequence of crucial commands of an intrusion, all the possible derived sequences as an intrusion scenario can be generated by means of the model. We may also use the model to detect the attacks from different cooperating attackers and the attacks from one attacker in different login sessions. Furthermore, a derived intrusion can be seen as an unknown intrusion, in this sense that the technique presented in this paper can detect some unknown intrusions.
A Constrained Argumentation System for Practical Reasoning
Authors: Leila Amgoud, Caroline Devred, Marie-Christine Lagasquie-Schiex
Venue: Argumentation in Multi-Agent Systems: Fifth International Workshop, ArgMAS 2008, Estoril, Portugal, May 12, 2008. Revised Selected and Invited Papers (2009)

Practical reasoning (PR), which is concerned with the generic question of what to do, is generally seen as a two steps process: (1) deliberation, in which an agent decides what state of affairs it wants to reach ---that is, its desires; and (2) means-ends reasoning, in which the agent looks for plans for achieving these desires. A desire is justified if it holds in the current state of the world, and feasible if there is a plan for achieving it. The agent's intentions are thus a consistent subset of desires that are both justified and feasible. This paper proposes the first argumentation system for PR that computes in one step the intentions of an agent, allowing thus to avoid the drawbacks of the existing systems. The proposed system is grounded on a recent work on constrained argumentation systems, and satisfies the rationality postulates identified in argumentation literature, namely the consistency and the completeness of the results.