ppxscal/embedding_network huggingface dataset:
FPGA-Based Anomalous Trajectory Detection Using SOFM
Authors: Kofi Appiah, Andrew Hunter, Tino Kluge, Philip Aiken, Patrick Dickinson
Venue: Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications (2009)

A system for automatically classifying the trajectory of a moving object in a scene as usual or suspicious is presented. The system uses an unsupervised neural network (Self Organising Feature Map) fully implemented on a reconfigurable hardware architecture (Field Programmable Gate Array) to cluster trajectories acquired over a period, in order to detect novel ones. First order motion information, including first order moving average smoothing, is generated from the 2D image coordinates (trajectories). The classification is dynamic and achieved in real-time. The dynamic classifier is achieved using a SOFM and a probabilistic model. Experimental results show less than 15% classification error, showing the robustness of our approach over others in literature and the speed-up over the use of conventional microprocessor as compared to the use of an off-the-shelf FPGA prototyping board.
Adaptive Step-size and Block-size FBLMS Algorithm
Authors: Qun Yang, Lin Xiao, Xuewen Zeng, Jinlin Wang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

In this paper, we present a novel adaptive step-size and block-size frequency-domain block least mean square (ASB-FBLMS) algorithm. The convergence speed and the steady stage error are two conflicting factors in the traditional frequency-domain block least mean square (FBLMS) algorithm. While our algorithm optimally increase the convergence speed while maintaining or reducing the steady stage error by using an adaptive variable step-size and an adaptive variable block-size, it can also reduce the computational complexity effectively in a high transmission rate by utilizing an adaptive variable block-size. Through the simulation on the Matlab platform, the results demonstrated that our algorithm outperformed FBLMS algorithms currently reported in the literature in terms of faster convergence, smaller steady stage error and lower computational complexity.
Indirectly driven knowledge modelling in ecology
Authors: Deana D. Pennington, Ioannis N. Athanasiadis, Shawn Bowers, Serguei Krivov, Joshua Madin, Mark Schildhauer, Ferdinando Villa
Venue: International Journal of Metadata, Semantics and Ontologies (2008)

We describe collaborative efforts among a group of Knowledge Representation (KR) experts, domain scientists, and scientific information managers in developing knowledge models for ecological and environmental concepts. The development of formal, structured approaches to KR used by the group (i.e., ontologies) can be informed by evidence marshalled from unstructured approaches to KR and semantic tagging already in use by the community.
Driver drowsiness detection with eyelid related parameters by Support Vector Machine
Authors: Shuyan Hu, Gangtie Zheng
Venue: Expert Systems with Applications: An International Journal (2009)

Various investigations show that drivers' drowsiness is one of the main causes of traffic accidents. Thus, countermeasure device is currently required in many fields for sleepiness related accident prevention. This paper intends to perform the drowsiness prediction by employing Support Vector Machine (SVM) with eyelid related parameters extracted from EOG data collected in a driving simulator provided by EU Project SENSATION. The dataset is firstly divided into three incremental drowsiness levels, and then a paired t-test is done to identify how the parameters are associated with drivers' sleepy condition. With all the features, a SVM drowsiness detection model is constructed. The validation results show that the drowsiness detection accuracy is quite high especially when the subjects are very sleepy.
Emotion in HCI
Authors: Christian Peter, Russell Beale, Elizabeth Crane, Lesley Axelrod
Venue: Proceedings of the 21st British HCI Group Annual Conference on HCI 2008: People and Computers XXI: HCI...but not as we know it - Volume 2 (2007)

An increasing number of conferences, symposia, workshops, journals and books address the subject of emotions and their role in Human-Computer Interaction, including workshops at the last two HCI conferences. The need for discussion, exchange of ideas, and interdisciplinary collaboration is ever-increasing as the community grows. This workshop will meet the requirements of individuals working in fields affected by emotion, giving them a podium to raise their questions and work with like-minded people of various disciplines on common subjects. It will focus around four sessions, and will use predominantly small group work, rather than being presentation-based.
Dynamic thread assignment in web server performance optimization
Authors: Wemke van der Weij, Sandjai Bhulai, Rob van der Mei
Venue: Performance Evaluation (2009)

Popular web sites are expected to handle huge number of requests concurrently within a reasonable time frame. The performance of these web sites is largely dependent on effective thread management of their web servers. Although the implementation of static and dynamic thread policies is common practice, remarkably little is known about the implications on performance. Moreover, the commonly used policies do not take into account the complex interaction between the threads that compete for access to a shared resource. We propose new dynamic thread-assignment policies that minimize the average response time of web servers. The web server is modeled as a two-layered tandem of multi-threading queues, where the active threads compete for access to a common resource. This type of two-layered queueing model, which occurs naturally in the performance modeling of systems with intensive software-hardware interaction, are on the one hand appealing from an application point of view, but on the other hand are challenging from a methodological point of view. Our results show that the optimal dynamic thread-assignment policies yield strong reductions in the response times. Validation on an Apache web server shows that our dynamic thread policies confirm our analytical results.
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Authors: Mathieu Leconte, Jian Ni, Rayadurgam Srikant
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in degraded throughput performance in general wireless networks. In this paper, we prove that GMS achieves 100% throughput in all networks with eight nodes or less, under the two-hop interference model. Further, we obtain performance bounds that improve upon previous results for larger networks up to a certain size. We also provide a simple proof to show that GMS can be implemented using only local neighborhood information in networks of any size.
Application of the active learning method to the retrieval of pigment from spectral remote sensing reflectance data
Authors: H. Taheri Shahraiyni, S. Bagheri Shouraki, F. Fell, M. Schaale, J. Fischer, A. Tavakoli, R. Preusker, M. Tajrishy, M. Vatandoust, H. Khodaparast
Venue: International Journal of Remote Sensing (2009)

Due to the noise that is present in remote sensing data, a robust method to retrieve information is needed. In this study, the active learning method (ALM) is applied to spectral remote sensing reflectance data to retrieve in-water pigment. The heart of the ALM is a fuzzy interpolation method that is called the ink drop spread (IDS). Three datasets (SeaBAM, synthetic and NOMAD) are used for the evaluation of the selected ALM approach. Comparison of the ALM with the ocean colour 4 (OC4) algorithm and the artificial neural network (ANN) algorithm demonstrated the robustness of the ALM approach in retrieval of in-water constituents from remote sensing reflectance data. In addition, the ALM identified and ranked the most relevant wavelengths for chlorophyll and pigment retrieval.
Risk analysis in software development
Authors: Craig Comstock, Zhizhong Jiang, Peter Naudé
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

Software is the key factor influencing the success of computer-based systems. However, software is expensive to develop, and there are great potential risks to deliver software without any overrun of the cost. In this study we investigated the amount of risk in terms of the range of possible productivity that can be expected in a portfolio of software development projects. Working on a large database with 4106 software projects, this study revealed that inefficient development teams can spend as many as 13 times of the effort taken by proficient teams for the development. This study further examined the effects of project size and team size on the variance in software development effort. The results showed that to reduce the risks of cost overruns, a small project is better than a large project when the team size is chosen in advance, and small team is preferable to a large team for a project of a fixed size.
A fuzzy genetic algorithm for the discovery of process parameter settings using knowledge representation
Authors: H. C. W. Lau, C. X. H. Tang, G. T. S. Ho, T. M. Chan
Venue: Expert Systems with Applications: An International Journal (2009)

In this paper, we propose a fuzzy genetic algorithm (Fuzzy-GA) approach integrating fuzzy rule sets and their membership function sets, in a chromosome. The proposed approach consists of two processes: knowledge representation and knowledge assimilation. The knowledge of process parameter setting is encoded as a string with a fuzzy rule set and the associated membership functions. The historical process data forming a combined string is used as the initial knowledge population, which is then ready for knowledge assimilation. A genetic algorithm is used to generate an optimal or nearly optimal fuzzy set and membership functions for the process parameters. The originality of this research is that the proposed system is equipped with the ability to take advantage of assessing the loss which is caused by discrepancy with a process target, thereby enabling the identification of the best set of process parameters. The approach is demonstrated by the use of an experimental example drawn from a semiconductor manufacturer and the results show us that the suggested approach is able to achieve an optimal solution for a process parameter setting problem.
(d+1,2) -Track Layout of Bipartite Graph Subdivisions
Authors: Miki Miyauchi
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A (k,2-track layout of a graph G consists of a 2-track assignment of G and an edge k-coloring of G with no monochromatic X-crossing. This paper studies the problem of (k,2)-track layout of bipartite graph subdivisions. Recently V.Dujmović and D.R.Wood showed that for every integer d > 2, every graph G with n vertices has a (d+1,2)-track layout of a subdivision of G with 4┌logdqn(G)┐ + 3 division vertices per edge, where qn(G) is the queue number of G. This paper improves their result for the case of bipartite graphs, and shows that for every integer d > 2, every bipartite graph Gm,n has a (d + 1,2)-track layout of a subdivision of Gm,n with 2 ⌈logdn⌉-1 division vertices per edge, where m and n are numbers of vertices of the partite sets of Gm,n with m >n.
Electron field emission from ZnO self-organized nanostructures and doped ZnO: Ga nanostructured films
Authors: V. A. Karpyna, A. A. Evtukh, M. O. Semenenko, V. I. Lazorenko, G. V. Lashkarev, V. D. Khranovskyy, R. Yakimova, D. A. Fedorchenko
Venue: Microelectronics Journal (2009)

Self-organized ZnO nanostructures were grown by thermal decomposition of metalorganic precursors as well as by carbothermal reduction process. Nanostructured undoped and gallium-doped ZnO nanostructured films were deposited by plasma-enhanced chemical vapor deposition from metalorganic compounds. Electron field emission follows Fowler-Nordheim equation. Efficient electron emission was obtained from self-organized nanostructures due to their geometric shape. Enhanced field emission from ZnO:Ga nanostructured films in comparison with undoped ZnO films is obliged to lowering work function at doping by gallium.
Hybrid Tableaux for the Difference Modality
Authors: Mark Kaminski, Gert Smolka
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

We present the first tableau-based decision procedure for basic hybrid logic with the difference modality. The decision procedure is gracefully degrading in that the less expressive constructs don't pay for the computationally expensive difference modality. The procedure can be specialized to reflexive and transitive frames. Key features of our approach are nominal elimination, pattern-based blocking, and expansion control.
Virtual Exhibitions as a Collection Environment of Cultural Events
Authors: G. Garibotto, M. V. Oneto, C. Coelho, M. Marson, G. Tartaglione, L. Maccabruni
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Multimedia technology provides improved solutions to allow access to distributed resources and data in a variety of applications.There are examples of implementation in different domains, from commercial distribution through electronic commerce to virtual museums and dissemination of cultural information. In particular in the Cultural Heritage area there are already many different implementations of high quality services which are distributed either through specialised CD's or through the Internet [1],[2]. The paper refers an experience which has been performed by Elsag SPA, in cooperation with Florence Archivio di Stato, to exploit the use of multimedia technology in the area of Virtual Exhibition, in order to maintain a memory of temporary events which otherwise, after the closure of the event itself are bound to disappear.The experiment has been implemented with the use of consolidated tools and techniques and demonstrates the maturity of available technology as well as its limitations and need of improvement.
A Method for Assigning Men and Women with Good Affinity to Matchmaking Parties through Interactive Evolutionary Computation
Authors: Sho Kuroiwa, Yoshihiro Murata, Tomoya Kitani, Keiichi Yasumoto, Minoru Ito
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

In this paper, we define a matchmaking party assignment problem and propose a system to solve it. The problem is to assign male and female participants to several small groups so that each group consists of the same number of men and women who have a good affinity for each other. The proposed system solves the problem based on an IEC (interactive evolutionary computation) framework, which can treat indefinable evaluation functions such as affinity between men and women by feeding back the empirically obtained values of those functions. Given each participant's attributes such as bodily characteristics, academic background, and personality, which are obtained by questionnaire in advance, the system assigns the participants to several small groups in order to maximize the number of man and woman pairs likely to begin relationships. After each groups party, the number of pairs who liked each other can be obtained as a value of the evaluation function for EC (evolutionary computation). To evaluate the system, we define the NMax Problem assuming that there would be N good affinity patterns between men and women. Through computer simulations with N from 2 to 5, we confirmed that the proposed system could find a much better group assignment than a greedy approach.
Particle swarm optimizer, ant colony strategy and harmony search scheme hybridized for optimization of truss structures
Authors: A. Kaveh, S. Talatahari
Venue: Computers and Structures (2009)

A heuristic particle swarm ant colony optimization (HPSACO) is presented for optimum design of trusses. The algorithm is based on the particle swarm optimizer with passive congregation (PSOPC), ant colony optimization and harmony search scheme. HPSACO applies PSOPC for global optimization and the ant colony approach is used to update positions of particles to attain the feasible solution space. HPSACO handles the problem-specific constraints using a fly-back mechanism, and harmony search scheme deals with variable constraints. Results demonstrate the efficiency and robustness of HPSACO, which performs better than the other PSO-based algorithms having higher converges rate than PSO and PSOPC.
Topological analysis of a two coupled evolving networks model for business systems
Authors: Juan Wang, Philippe De Wilde, Hui Wang
Venue: Expert Systems with Applications: An International Journal (2009)

In multi-agent systems, the underlying networks are always dynamic and network topologies are always changing over time. Performance analyses of topologies are important for understanding the robustness of the system and also the effects of topology on the system efficiency and effectiveness. In this paper, we present an example of a real-world distributed agent system, a digital business ecosystem (DBE). It is modelled as a two coupled network system. The upper layer is the business network layer where business process between different business agents happen. The lower layer is the underlying P2P communication layer to support communications between the agents. Algorithms for multi-agent tasks negotiation and execution, interaction between agents and the underlying communication network, evolutionary network topology dynamics, are provided. These algorithms consider the two network layers evolving over time, with effects on each other. Through a comprehensive set of discrete event simulation, we investigate the effects of different evolutionary principles inspired by random graph and scale-free network in complex network theory on the topological properties and performance of the underlying network. We also find several rules to design a resilient and efficient P2P network.
Framework for execution level capacity allocation decisions for assembly: test facilities using integrated optimization - simulation models
Authors: Shrikant Jarugumilli, Mengying Fu, Naiping Keng, Chad DeJong, Ronald Askin, John Fowler
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We present a framework for capacity allocation decisions for Assembly-Test (A-T) facilities that is comprised of an optimization model and a simulation model. The optimization and simulation models are used iteratively until a feasible and profitable capacity plan is generated. The models communicate using an automated feedback loop and at each iteration the model parameters are adjusted. We describe the role of the optimization model, the simulation model and the feedback loop. Once the capacity plan is generated, it is passed down to the shop-floor for implementation. Hence, decision makers can develop accurate and more profitable execution level capacity plans using the integrated model which utilizes both optimization and simulation models. In this paper, we focus on the optimization model for capacity planning for the entire A-T facility at the individual equipment (resource) level for a two-week planning period and briefly discuss the simulation and the adjustment model.
Constrained Point-Set Embeddability of Planar Graphs
Authors: Emilio Giacomo, Walter Didimo, Giuseppe Liotta, Henk Meijer, Stephen Wismath
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

This paper starts the investigation of a constrained version of the point-set embeddability problem. Let G&thinsp;=&thinsp;(V,E) be a planar graph with n vertices, G&prime;&thinsp;=&thinsp;(V&prime;,E&prime;) a subgraph of G, and S a set of n distinct points in the plane. We study the problem of computing a point-set embedding of G on S subject to the constraint that G&prime; is drawn with straight-line edges. Different drawing algorithms are presented that guarantee small curve complexity of the resulting drawing, i.e. a small number of bends per edge. It is proved that: (i) If G&prime; is an outerplanar graph and S is any set of points in convex position, a point-set embedding of G on S can be computed such that the edges of E&thinsp;∖&thinsp;E&prime; have at most 4 bends each. (ii) If S is any set of points in general position and G&prime; is a face of G or if it is a simple path, the curve complexity of the edges of E&thinsp;∖&thinsp;E&prime; is at most 8. (iii) If S is in general position and G&prime; is a set of k disjoint paths, the curve complexity of the edges of E&thinsp;∖&thinsp;E&prime; is O(2 k ).
Language Identification on the Web: Extending the Dictionary Method
Authors: Radim &#;344ehůřek, Milan Kolkus
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

Automated language identification of written text is a well-established research domain that has received considerable attention in the past. By now, efficient and effective algorithms based on character n-grams are in use, mainly with identification based on Markov models or on character n-gram profiles. In this paper we investigate the limitations of these approaches when applied to real-world web pages. The challenges to be overcome include language identification on very short texts, correctly handling texts of unknown language and texts comprised of multiple languages. We propose and evaluate a new method, which constructs language models based on word relevance and addresses these limitations. We also extend our method to allow us to efficiently and automatically segment the input text into blocks of individual languages, in case of multiple-language documents.
Approximate Retrieval with HiPeR: Application to VA-Hierarchies
Authors: Nouha Bouteldja, Valerie Gouet-Brunet, Michel Scholl
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

In this article, we present an approximate technique that allows accelerating similarity search in high dimensional vector spaces. The presented approach, called HiPeR, is based on a hierarchy of subspaces and indices: it performs nearest neighbors search across spaces of different dimensions, starting with the lowest dimensions up to the highest ones, aiming at minimizing the effects of the curse of dimensionality. In this work, HiPeR has been implemented on the classical index structure VA-File, providing VA-Hierarchies. The model of precision loss defined is probabilistic and non parametric and quality of answers can be selected by user at query time. HiPeR is evaluated for range queries on 3 real data-sets of image descriptors varying from 500,000 vectors to 4 millions. The experiments show that this approximate technique improves retrieval by saving I/O access significantly.
Jigsaw, a programming environment for Java in CS1
Authors: Carl Burch
Venue: Journal of Computing Sciences in Colleges (2009)

This paper introduces a new open-source, cross-platform programming environment designed specifically for Java-based CS1 courses. Jigsaw, as it is called, uses an intentionally simple single-window interface, incorporating several features useful for the classroom context. One such feature is that upon successful compilation, the environment checks the student program for common student errors with Java, such as mistakenly writing "void" as a return type on what is intended as a constructor declaration.