ppxscal/embedding_network huggingface dataset:
Simulation of three-dimensional phytoplankton dynamics: comptetion in light-limited environments
Authors: N. N. Pham Thi, J. Huisman, B. P. Sommeijer
Venue: Journal of Computational and Applied Mathematics (2005)

In this paper, we develop computational methods for a three-dimensional model of competition for light between phytoplankton species. The competing phytoplankton populations are exposed to both horizontal and vertical mixing. The vertical light-dependence of phytoplankton photosynthesis implies that the three-dimensional model is formulated in terms of integro-partial differential equations that require an efficient numerical solution technique.Due to the stiffness of the discretized system we select an implicit integration method. However, the resulting implicit relations are extremely expensive to solve, caused by the strong coupling of the components. This coupling originates from the three spatial dimensions, the interaction of the various species and the integral term. To reduce the amount of work in the linear algebra part, we use an Approximate Matrix Factorization technique.The performance of the complete algorithm is demonstrated on the basis of two test examples. It turns out that unconditional stability (i.e., A-stability) is a very useful property for this application.
Tipster/MUC-5: information extraction system evaluation
Authors: Beth M. Sundheim
Venue: Proceedings of the 5th conference on Message understanding (1993)

Three information extraction system evaluations using Tipster data were conducted in the context of Phase 1 of the Tipster Text program. Interim evaluations were conducted in September, 1992, and February, 1993; the final evaluation was conducted in July, 1993. The final evaluation included not only the Tipster-supported information extraction contractors but thirteen other participants as well. This evaluation was the topic of the Fifth Message Understanding Conference (MUC-5) in August, 1993. With particular respect to the research and development tasks of the Tipster contractors, the goal of these evaluations has been to assess success in terms of the development of systems to work in both English and Japanese (BBN, GE/CMU, and NMSU/Brandeis) and/or in both the joint ventures and microelectronics domains (BBN, GE/CMU, NMSU/Brandeis, and UMass/Hughes).
Defect Oriented Testing of Analog Circuits Using Wavelet Analysis of Dynamic Supply Current
Authors: Swarup Bhunia, Arijit Raychowdhury, Kaushik Roy
Venue: Journal of Electronic Testing: Theory and Applications (2005)

In recent years, Defect Oriented Testing (DOT) has been investigated as an alternative testing method for analog circuits. In this paper, we propose a wavelet transform based dynamic supply current (IDD) analysis technique for detecting catastrophic and parametric faults in analog circuits. Wavelet transform has the property of resolving events in both time and frequency domain simultaneously unlike Fourier transform which decomposes a signal in frequency components only. Simulation results on benchmark circuits show that wavelet transform has higher fault detection sensitivity than Fourier or time-domain methods and hence, can be considered very promising for defect oriented testing of analog circuits. Effectiveness of wavelet transform based DOT amidst process variation and measurement noise is studied.
Object detection/classification by probabilistic local matching
Authors: Megumi Yamaoka, Kenji Nagao
Venue: Systems and Computers in Japan (2004)

A new method for object detection and classification based on their shapes in images is presented. In the new method, to describe objects and match them with the models, local photometric features are incorporated with global shape features in a probabilistic framework, which is an extension of conventional approaches to geometric object recognition. Results demonstrate the effectiveness of the proposed method in vehicle detection in road images with background clutter, as well as in face detection under varying lighting conditions. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(9): 10&ndash;19, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10641
Efficient constraint processing for location-aware computing
Authors: Zhengdao Xu, Hans-Arno Jacobsen
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

For many applications, such as friend finder, buddy tracking, and location mapping in mobile wireless networks or information sharing and cooperative caching in mobile ad hoc networks, it is often important to be able to identify whether a given set of moving objects is close to each other or close to a given point of demarcation. To achieve this, continuously available location position information of thousands of mobile objects must be correlated against each other to identify whether a fixed set of objects is in a certain proximity relation, which, if satisfied, would be signaled to the objects or any interested party. In this paper, we state this problem, referring to it as the location constraint matching problem and present and evaluate solutions for solving it. We introduce two types of location constraints to model the proximity relations and experimentally validate that our solution scales to the processing of hundreds of thousands of constraints and moving objects.
CODACS Prototype: A Platform-Processor for CHIARA Programs
Authors: Lorenzo Verdoscia
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

CODACS (COnfigurable DAtaflow Computing System) project target is to realize a high performance reconfigurable computing system demonstrator able to directly execute in hardware dataflow graphs generated compiling programs written in CHIARA language. In this paper we present the reconfigurable environment and how it executes chunks of a dataflow graph produced by CHIARA compiler. This environment, which is transparent to the user, consists of a set of processing elements called platformprocessors. Each platform-processor, based on the static dataflow model, is created by a set of identical Computing Units (CUs) and a reconfigurable interconnect. While CUs execute any elementary operator of the language, implement the actor described in the homogeneous High-Level Dataflow System model, and act according to the model firing rules, the reconfigurable interconnect allows to execute dataflow graphs directly in hardware. Furthermore, thanks to the homogeneous actor I/O conditions (one output and two input links) of the model, a one-to-one mapping between dataflow actors of the model and CUs occurs in a straightforward manner. Consequently, the platformprocessor executes dataflow graphs without: a) using memory to store partial results when data tokens flow from a CU to another; b) generating control tokens during this computation so that graph executions can happen in a completely asynchronous manner. However, synchronizing CUs activities, the platform-processor architecture also allows the execution of pipeline operations.
Gradual probabilistic DFA learning with caching for conversational agents
Authors: Masayuki Okamoto
Venue: Systems and Computers in Japan (2004)

This paper proposes a method of reducing the cost of gradually constructing task-oriented conversational agents with FSMs by collecting example dialogues. Probabilistic-DFA learning algorithms with the state merging method are available for the FSM-based dialogue model. However, these algorithms must learn the whole model again as often as the example data increase.We proposed a learning technique which decreases the recomputation cost by caching the history of the state merging process. Simulation and actual use of a conversational agent with 110 tour-guide dialogues showed that the method which recomputes only compatibility-changed states reduced the total compatibility-checking cost by 33.0&percnt; without significantly changing the quality of learned models. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(7): 24&ndash;32, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10653
Simulating perfect channels with probabilistic lossy channels
Authors: Parosh Abdulla, Christel Baier, S. Purushothaman Iyer, Bengt Jonsson
Venue: Information and Computation (2005)

We consider the problem of deciding whether an infinite-state system (expressed as a Markov chain) satisfies a correctness property with probability 1. This problem is, of course, undecidable for general infinite-state systems. We focus our attention on the model of probabilistic lossy channel systems consisting of finite-state processes that communicate over unbounded lossy FIFO channels. Abdulla and Jonsson have shown that safety properties are decidable while progress properties are undecidable for non-probabilistic lossy channel systems. Under assumptions of "sufficiently high" probability of loss, Baier and Engelen have shown how to check whether a property holds of probabilistic lossy channel system with probability 1. In this paper, we consider a model of probabilistic lossy channel systems, where messages can be lost only during send transitions. In contrast to the model of Baier and Engelen, once a message is successfully sent to channel, it can only be removed through a transition which receives the message. We show that checking whether safety properties hold with probability 1 is undecidable for this model. Our proof depends upon simulating a perfect channel, with a high degree of confidence, using lossy channels.
Information search and re-access strategies of experienced web users
Authors: Anne Aula, Natalie Jhaveri, Mika Käki
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

Experienced web users have strategies for information search and re-access that are not directly supported by web browsers or search engines. We studied how prevalent these strategies are and whether even experienced users have problems with searching and re-accessing information. With this aim, we conducted a survey with 236 experienced web users. The results showed that this group has frequently used key strategies (e.g., using several browser windows in parallel) that they find important, whereas some of the strategies that have been suggested in previous studies are clearly less important for them (e.g., including URLs on a webpage). In some aspects, such as query formulation, this group resembles less experienced web users. For instance, we found that most of the respondents had misconceptions about how their search engine handles queries, as well as other problems with information search and re-access. In addition to presenting the prevalence of the strategies and rationales for their use, we present concrete designs solutions and ideas for making the key strategies also available to less experienced users.
An O(log n log log n) space algorithm for undirected st-connectivity
Authors: Vladimir Trifonov
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We present a deterministic O(log n log log n) space algorithm for undirected st-connectivity. It is based on the deterministic EREW algorithm of Chong and Lam [6] and uses the universal exploration sequences for trees constructed by Koucký [13]. Our result improves the O(log4/3 n) bound of Armoni et al.\ [2] and is a big step towards the optimal O(log n). Independently of our result and using a different set of techniques, the optimal bound was achieved by Reingold [18].
Apply Data Mining to Defense-in-Depth Network Security System
Authors: Nen-Fu Huang, Chia-Nan Kao, Hsien-Wei Hun, Gin-Yuan Jai, Chia-Lin Lin
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This paper proposes a defense in depth network security architecture and applies the data mining technologies to analyze the alerts collected from distributed intrusion detection and prevention systems (IDS/IPS). The proposed defense in depth architecture consists of a Global Policy Sever (GPS) to manage the scattered intrusion detection and prevention systems, each of which is managed by a Local Policy Server (LPS). The key component of the GPS is the security information management (SIM) module where data mining technology is employed to analyze the events (alerts) collected from the LPSs. Once a DDoS attack is recognized by the SIM module, the GPS will inform the LPS (IDS/IPS) to adjust the thresholds immediately to block the attack from the sources. To evaluate the effectiveness of the proposed defense in depth architecture, a prototyping is implemented, where three different data mining tools are employed. Experiment results demonstrate that for detecting the DDOS attacks, the proposed data mining-based defense in depth architecture performs very well on attack detection rate and false alarm rate.
Automatic performance evaluation and feedback for MASCOT designs
Authors: Pere P. Sancho, Carlos Juiz, Ramon Puigjaner
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

This paper is concerned about simulation output analysis. This analysis should serve the purpose of making a diagnose about the simulated system and give some hints about possible improvements. The article has its base on previous work done by the same authors[6] but it goes a little further. Some diagnose tools are presented which take as input the simulation results of our simulator and analyzes them to make a statement about the behavior and performance of the simulated system. Moreover, the diagnose tools can give advice on how to improve the system's performance.
TRIOPT: a triangulation-based partitioning algorithm for global optimization
Authors: Y. Wu, L. Ozdamar, A. Kumar
Venue: Journal of Computational and Applied Mathematics (2005)

We propose a triangulation-based partitioning algorithm, TRIOPT, for solving low-dimensional bound-constrained black box global optimization problems. The method starts by forming a Delaunay triangulation of a given set of samples in the feasible domain, and then, it assesses the simplices (partitions) obtained for re-partitioning. Function values at the vertices of each partition are mapped into the zero one interval by a nonlinear transformation function and their aggregate entropy is calculated. Based on this entropy, partitions that hold a promise of containing the global optimum are re-partitioned according to different triangular splitting strategies, forming new partitions. These strategies are efficient in terms of the number of new function evaluations required per new partition.A novelty in the search scheme proposed here is that once a partition narrows down to a small size, its vertices are eliminated from the available sample set. This changes global information on the best solution and triggers a re-calculation of transformed values. Hence, revised entropies change the direction of the search to new areas. The latter scheme leads to a dynamic parallel search policy which is based on an entropy cut. The tree adopts flexible breadth depending on the status of the search. In the experimental results it is demonstrated that TRIOPTs performance is compatible and often better than that of a well-known response surface methodology and two other efficient black box partitioning approaches proposed for global optimization.
Comparative Assessment of Algorithms and Software for Global Optimization
Authors: Charoenchai Khompatraporn, János D. Pintér, Zelda B. Zabinsky
Venue: Journal of Global Optimization (2005)

The thorough evaluation of optimization algorithms and software demands devotion, time, (code development and hardware) resources, in addition to professional objectivity. This general remark is particularly valid with respect to global optimization (GO) software since GO literally encompasses "all" mathematical programming models. It is easy not only to fabricate very challenging test problems, but also to find realistic GO problems that pose a formidable task for any algorithm of today and of tomorrow.A report on computational experiments should ideally cover a large number of aspects: a detailed description and practical background of the models; earlier related work; solution approaches; algorithm implementations and their parameterization; hardware platforms, operating systems, and software environments; an exact description of all performance measures; report of successes and failures; analysis of solver parameterization effects; statistical characteristics for randomized problem-classes; and a summary of results (in text, tabular and/or graphical forms).An extensive inventory of classical NLP and GO test problems, as well as more recent (and often much harder) test suites have been suggested. This paper reviews several prominent test collections, discusses comparison issues, and presents illustrative numerical results. A second paper will perform a comparative study using ideas presented here, drawing also on discussions at the Stochastic Global Optimization Workshop (held in New Zealand, June 2001).
Face Recognition by Capturing Eye Illumination Spot
Authors: Navchetan Singh
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Here a method is presented which recognizes a face by capturing a unique illumination spot created in the centre of the eye i.e. the cornea. This illumination spot is always there whenever we are in light or in front of a light source. This algorithm works by running an edge detector on a sample face. The edge detector produces a dark spot in place of the illumination spot and a semicircular arc in place of the beginning of the cornea. This arc and the dark spot act as a unique template for capturing eye in the image and following this we extract other features i.e. eyebrows, lipline and chinline. Following this we calculate the vertical distance of each feature from every other feature and use these distance parameters to recognize faces.
Practical Application of Formal Methods for Specification and Analysis of Software Architecture
Authors: Cameron Maxwell, Artem Parakhine, John Leaney
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

With the ever-growing pace of technological advancement, computer software is required to become increasingly complex to meet the demands of todayýs leading edge technologies, and their applications. However, fulfilling this requirement creates new, previously unknown, problems pertaining to non-functional properties of software. Specifically, as the software complexity escalates, it becomes increasingly difficult to scale the software in order to cope with the sometimes overwhelming demand created by system growth. It is therefore essential to have processes for addressing the issues associated with scalability that arise due to the complexity in software systems. In this paper we describe an approach aimed at fulfilling the need for such processes. A combination of Object-Z and temporal logic is used to create an architectural description open to further analysis.We also demonstrate the practicality of this methodology within the context of the Coordinated Adaptive Traffic System (CATS).
Creating a Web Site with Flash: Visual QuickProject Guide (Visual Quickproject Series)
Authors: David Morris
Venue:  (2005)

Face it: Poorly designed, static Web sites just don't cut it anymore. The Web (not to mention the technology surrounding it) has been around long enough, and people have grown accustomed enough to dealing with it, that folks want (and expect) a little razzle-dazzle when they go online. For just $12.99, this compact guide shows you how to deliver it! Whether your boss wants you to jazz up the company's Web site or you're burning the midnight oil trying to pull together some Web animations for a class project, this tightly focused, project-based guide shows you how to start creating Flash animations in an instant! Using big, bold full-color pictures and streamlined instructions, it covers just the need-to-know essentials that will get you animating with Flash: using the Flash authoring tool, creating and animating graphics, tweening, adding sound, and more.
Comparative genomic assessment of novel broad-spectrum targets for antibacterial drugs: Research Articles
Authors: Thomas A. White, Douglas B. Kell
Venue: Comparative and Functional Genomics (2004)

Single and multiple resistance to antibacterial drugs currently in use is spreading, since they act against only a very small number of molecular targets; finding novel targets for anti-infectives is therefore of great importance. All protein sequences from three pathogens (Staphylococcus aureus, Mycobacterium tuberculosis and Escherichia coli O157:H7 EDL993) were assessed via comparative genomics methods for their suitability as antibacterial targets according to a number of criteria, including the essentiality of the protein, its level of sequence conservation, and its distribution in pathogens, bacteria and eukaryotes (especially humans). Each protein was scored and ranked based on weighted variants of these criteria in order to prioritize proteins as potential novel broad-spectrum targets for antibacterial drugs. A number of proteins proved to score highly in all three species and were robust to variations in the scoring system used. Sensitivity analysis indicated the quantitative contribution of each metric to the overall score. After further analysis of these targets, tRNA methyltransferase (trmD) and translation initiation factor IF-1 (infA) emerged as potential and novel antimicrobial targets very worthy of further investigation. The scoring strategy used might be of value in other areas of post-genomic drug discovery. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Highly Configurable Programmable Built-In Self Test Architecture for High-Speed Memories
Authors: Ismet Bayraktaroglu, Olivier Caty, Yickkei Wong
Venue: Proceedings of the 23rd IEEE VLSI Test Symposium (2005)

With the rapid growth in the number, the size, and the density of embedded memories in the current generation of microprocessors, developing high coverage Memory Built-In Self-Test (MBIST) engines has become increasingly challenging. The MBIST engine should provide high defect coverage and accurate diagnostic capabilities. Furthermore, MBIST engine should be accessible not only at the tester but also at the system. We present our work to develop a MBIST architecture that fulfills all such requirements and supports various flavors of embedded SRAMs. Extensive utilization of the proposed architecture in our products will result in increased productivity by reducing the development time and the verification and productization effort.
A mass customization information framework for integration of customer in the configuration-design of a customized product
Authors: Zahed Siddique, Karunakar Reddy Boddu
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2004)

One of the aspects of mass customization is to provide customers with products that are manufactured to their needs and requirements. To provide such support requires better integration of the customer into different stages of design and manufacturing. Expansion of the Internet provides an opportunity for such an integration, which will need to link design and manufacturing of the company with the customer. In current approaches, customers usually specify the options and get the price or simple pictures of the object. In this paper we present a framework in which customer options and size parameters are gathered using the Internet. It is used to automatically generate a 3-dimensional computer-aided design model of the product, estimate the price of the product, and generate assembly sequence information. The framework for mass customization of products necessitates information management among different segments of the company and the customer. The Internet-based system presented in this paper uses a graph grammar and templates to explicitly maintain correspondence among various types of product information from a module perspective. The system is demonstrated using a customizable coffeemaker product family.