ppxscal/embedding_network huggingface dataset:
Energy Evolution of Neural Population under Coupling Condition
Authors: Rubin Wang, Zhikang Zhang, Enhua Shen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

On the based of principle of the energy coding, an energy function of variety of electric potential of neural population in cerebral cortex is proposed. The energy function is used to describe the energy evolution of neuronal population with time, and the coupled relationship between neurons at sub-threshold and at supra-threshold status. We obtain the Hamiltonian motion equation with the membrane potential under condition of Gaussian white noise according to neuro-electrophysiological data. The results of research show that the mean of the membrane potential obtained in this paper is just exact solution of motion equation of membrane potential in previous published paper. It is showed that the Hamiltonian energy function given in the paper is effective and correct. Particularly, by using the principle of energy coding we obtained an interesting result which is in subsets of neurons firing action potentials at supra-threshold and others simultaneously perform activities at sub-threshold level in neural ensembles. As yet, this kind of coupling in all models of biological neural network has not been presented.
Research on Data Mining Based on Rough Set and Its Application in Fault Diagnosis of Steam Turbine
Authors: Qinglin Guo, Cunbin Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

For overcoming shortages of some current knowledge attaining methods, a novel approach for fault forecast and diagnosis of steam turbine based on rough set data mining theory is brought forward. Data pretreatment, knowledge reduction and rule abstraction are three important problems in the research of Rough Set Theory.The historical fault data of steam turbine is processed with fuzzy and scatter method. The processed data is used to structure the fault diagnosis decision-making table that is treated as "knowledge database". This paper introduced rough sets data mining method to take potential diagnosis rule from the fault diagnosis decision-making table of steam turbine. These rules can offer effective fault diagnosis service for steam turbine. The algorithm for classified rule learning and reducing is brought forward, and an experimental system for fault forecast and diagnosis of steam turbine based on rough set data mining theory is implemented. Their diagnosis precision is above 88%. And experiments do prove that it is feasible to use the method to develop a system for fault forecast and diagnosis of steam turbine, which is valuable for further study in more depth.
Eventory -- An Event Based Media Repository
Authors: Xiang-jun Wang, Swathi Mamadgi, Atit Thekdi, Aisling Kelliher, Hari Sundaram
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper focuses on the development of an event driven media sharing repository to facilitate community awareness. In this paper, an event refers to a real-world occurrence that unfolds over space and time. Our event model implementation supports creation of events using the standard facets of who, where, when and what. A key novelty in this research lies in the support of arbitrary event-event semantic relationships. We facilitate global as well as personalized event relationships. Each relationship can be unary or binary and can be at multiple granularities. The relationships can exist between events, between media, and between media and events. We have implemented a web based media archive system that allows people to create, explore and mange events. We have implemented an RSS based notification system that promotes awareness of actions. The initial user feedback has been positive and we are in the process of conducting a longitudinal study.
A Probabilistic Approach to Web Portal's Data Quality Evaluation
Authors: Angelica Caro, Coral Calero, Emilia Mendes, Mario Piattini
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

Advances in technology and the use of the Internet have favoured the emergence of a large number of Web applications, including Web Portals. Web Portals provide the means to obtain a large amount of information therefore it is crucial that the information provided is of high quality. In recent years, several research projects have investigated Web Data Quality; however none has focused on data quality within the context of Web Portals. Therefore, the contribution of this research is to provide a framework centred on the point of view of data consumers, and that uses a probabilistic approach for Web portal's data quality evaluation. This paper shows the definition of operational model, based in our previous work.
Zero-anaphora resolution by learning rich syntactic pattern features
Authors: Ryu Iida, Kentaro Inui, Yuji Matsumoto
Venue: ACM Transactions on Asian Language Information Processing (TALIP) (2007)

We approach the zero-anaphora resolution problem by decomposing it into intrasentential and intersentential zero-anaphora resolution tasks. For the former task, syntactic patterns of zeropronouns and their antecedents are useful clues. Taking Japanese as a target language, we empirically demonstrate that incorporating rich syntactic pattern features in a state-of-the-art learning-based anaphora resolution model dramatically improves the accuracy of intrasentential zero-anaphora, which consequently improves the overall performance of zero-anaphora resolution.
Direct soft UV-NIL with resist incorporating carbon nanotubes
Authors: Jun-hyuk Choi, Sung-un Jung, Dae-geun Choi, Jun-ho Jeong, Eung-sug Lee
Venue: Microelectronic Engineering (2008)

As a potential candidate for the next generation of nanolithography, nanoimprint lithography (NIL) has drawn ever-increasing worldwide attention. It involves physical contact to overcome the optical limits occurring in sub-100nm photolithography. Affordable tool cost is one of major attractive points of NIL. This work proposes the idea of incorporating carbon nanotubes (CNTs) in the resin used for ultraviolet nanoimprinting (UV-NIL). CNTs can make the resin electrically conductive when mixed with it. Patterns imprinted in the CNT-mixed resist can then be used to replace conductive metal structures directly. This enhances the productivity of basic UV-NIL where the imprinted patterns are used as sacrificial etch masks. In this work, several types of CNTs were purified chemically and dispersed before being mixed with UV-NIL resin using ultrasonic vibration. On drops of CNT-mixed resin, soft UV-NIL was performed using a polydimethylsiloxane (PDMS) stamp with a minimum feature size in the range of 200nm. Even with increased resin viscosity due to the addition of CNTs, UV imprinting down to 200nm was successfully done with moderate pattern fidelity. The loading rate of nanotubes should be minimized to prevent the increased viscosity from degrading the pattern transfer resolution. The electrical conductivity of CNT-mixed resist increases with the loading of CNTs. Therefore, the trade-off between the electrical properties and pattern transfer resolution needs to be optimized carefully.
Performance Analysis and Optimization of the 802.11e EDCA Transmission Opportunity (TXOP) Mechanism
Authors: Lamia Romdhani, Christian Bonnet
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

The IEEE 802.11 Task Group E is working on a QoS-aware MAC protocol involving Enhanced Distributed Channel Access (EDCA). This scheme was developed to offer QoS capabilities to WLAN, offering significant im- provements to multimedia traffic. MANETs will also bene- fit from this new technology since the most widely deployed and used wireless cards are those based on IEEE 802.11. The use of transmission opportunity (TXOP) EDCA differ- entiation parameter, received a little attention in the previ- ous analytical studies in contrast to the contention window size-based differentiation mechanism. In this paper, an an- alytical model is proposed to study and optimize the TXOP bursting transmission scheme. We expose formulates for saturation throughput, delay, and frame-dropping of dif- ferent priority classes. The analysis allows us to derive the optimal durations of the packet bursting regarding ap- plication and network load parameters. We validate the accuracy of our model through ns-2 simulations.
Cryptographic techniques for mobile ad-hoc networks
Authors: Vanesa Daza, Javier Herranz, Paz Morillo, Carla Rífols
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

In this paper, we propose some cryptographic techniques to securely set up a mobile ad-hoc network. The process is fully self-managed by the nodes, without any trusted party. New nodes can join the network and are able to obtain the same capabilities as initial nodes; further, each node can obtain a pair of secret/public keys to secure and authenticate its communication. Two additional features of our system are that it allows to implement threshold operations (signature or decryption) involving subgroups of nodes in the network and that any subgroup with a small number of nodes (between 2 and 6) can obtain a common secret key without any communication after the set up phase.
Trustworthy Migration and Retrieval of Regulatory Compliant Records
Authors: Soumyadeb Mitra, Marianne Winslett, Windsor H. Hsu, Xiaonan Ma
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

Compliance storage servers are designed to meet organizational needs for trustworthy records retention, largely mandated by recent legislations such as HIPAA, SEC Rule 17a, and the Sarbanes-Oxley Act. These devices export a file-system-level interface, and enforce write-once readmany (WORM) semantics for file access. Compliance storage protects records from alteration, as long as they remain on the same storage server. However, the decades-long records retention requirements of recent legislation mean that a compliance storage server will often be obsolete long before the documents it contains can be destroyed. Unfortunately, records will be vulnerable to change during migration to a new server. Records are also vulnerable during retrieval, when they are taken off the server and "migrated" to the person or organization who needs them. In this paper, we propose techniques for trustworthy document migration and retrieval, by enhancing the storage servers with the capability to sign their files and directories. The proposed techniques can be used to verify that a migration was carried out properly, even across multiple migrations, deletions of expired documents, and changes in the content and structure of migrated directories. In our approach, file writers incur no performance penalty, which is important since compliance workloads are write-intensive. Migration incurs a reasonable 5-10% space overhead and requires 24 msec processing time per file. The result of the migration can be verified at a rate of 24 msec per file by a trustworthy auditor (or ordinary user), who can then generate a certificate attesting to the correctness of the migration.
A multiple server location-allocation model for service system design
Authors: Siddhartha S. Syam
Venue: Computers and Operations Research (2008)

Service systems are endemic in a service economy, and effective system design is fundamental to the competitiveness of service organizations such as retailers, distributors, and healthcare providers. This is because system design may significantly facilitate (or hinder) the attainment of important organizational objectives such as minimizing system cost and maximizing service level. This paper develops and solves a comprehensive nonlinear location-allocation model for service system design that incorporates several relevant costs and considerations. These include, for instance, transportation, facility, and waiting costs, queuing considerations, multiple servers, multiple order priority levels, multiple service sites, and service distance limits. The model is first converted to an equivalent linear form and then solved using Lagrangian relaxation. A computational study shows problems with 250 service districts, 60 service sites, and 250 candidate locations are solved in about two and a half minutes. An extensive managerial experiment is conducted that evaluates alternative system designs from a number of important perspectives including centralization versus decentralization, system configuration, and service distance limit. Each scenario is evaluated with respect to two fundamental criteria, namely, total cost and service level. The analysis provides insights into important tradeoffs that must be taken into consideration in designing an effective service system.
A system employing peer review and enhanced computer assisted assessment of querying skills
Authors: Michael de Raadt, Stijn Dekeyser, Tien Yu Lee
Venue: Informatics in education (2007)

In recent years a small number of web-based tools have been proposed to help students learn to write SQL query statements and also to assess students' SQL writing skills. SQLify is a new SQL teaching and assessment tool that extends the current state-of-the-art by incorporating peer review and enhanced automatic assessment based on database theory to produce more comprehensive feedback to students. SQLify (pronounced as squalify) is intended to yield a richer learning experience for students and reduce marking load for instructors. In this paper SQLify is compared with existing tools and important new features are demonstrated.
A System for Performance Evaluation of Partial Differential Equations Software
Authors: R. F. Boisvert
Venue: IEEE Transactions on Software Engineering (1979)

This paper describes a system to systematically compare the performance of various methods (software modules) for the numerical solution of partial differential equations. We discuss the general nature and large size of this performance evaluation problem and the data one obtains. The system meets certain design objectives that ensure a valid experiment: 1) precise definition of a particular measurement; 2) uniformity in defimition of variables entering the experiment; and 3) reproducibility of results. The ease of use of the system makes it possible to make the large sets of measurements necessary to obtain confidence in the results and its portability allows others to check or extend the measurements. The system has four parts: 1) semiautomatic generation of problems for experimental input; 2) the ELLPACK system for actually solving the equation; 3) a data management system to organize and access the experimental data; and 4) data analysis programs to extract graphical and statistical summaries from the data.
Modeling electronic institutions with extended colored Petri net
Authors: Guoyong Cai, Ji Gao, Yong Huang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

One of the most fundamental challenges in multi-agent system engineering is to enable predictable and reliable interaction amongst group of autonomy agents. Electronic Institution (EI) has been proposed as an important framework to deal with these challenges. A colored Petri net transducer (CPNt) approach is presented to represent an EI visually and formally. With existing CPN tools, an EI model can be simulated and verified automatically. Validated EI model serves as a fundamental mechanism to influence and constraint interactive behaviors of autonomy agents. As a result, predictable and reliable multi-agent system can be obtained. Comparing with other approaches, this approach has solid theoretic basis as it is extended from Petri net. Therefore existing engineering methodology of Petri net can be adapted to engineering electronic institution conveniently. A simple example is applied to illustrate the whole process of the proposed approach.
An Ant Colony Verification Algorithm
Authors: R. achid Rebiha, Giovanni L. Ciampaglia
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Büchi automata are widely used as a modeling formal- ism in formal verification. The emptiness check procedure is used to carry on the model checking of a model M of a system, against an LTL formula , that expresses the desidered properties the system should satisfy. Algorithms for the emptiness check on Büchi automata are able to find a faulty computation, if the language accepted by the au- tomaton of the synchronized product of M and is non empty. Nonetheless, these algorithms don't perform any op- timization on such solution. In this paper we propose an ant colony optimization algorithm for the emptiness check of a subclass of Büchi automata, that runs on-the-fly, that is without storing the whole digraph of the automaton in main memory, thus avoiding the problem of exponential growth of the state space. Our approach features a non standard search strategy, with the capability for artificial ants to backtrack during the constructive search, and to modify the graph of the automaton, by removing parts of it when no longer interesting for exploration.
A new family of optimized orthogonal Space-Times codes for PPM-based MIMO systems with imperfect channel estimates
Authors: Enzo Baccarelli, Mauro Biagi, Cristian Pelizzoni, Nicola Cordeschi
Venue: Wireless Personal Communications: An International Journal (2007)

In this contribution, we develop a single Multiple-Input Multiple Output (MIMO) transceiver for Orthogonal PPM (OPPM) data transmitted over (baseband) faded MIMO channels with a priori unknown path-gains. The signaling-scheme we adopt allows to equip the Maximum-Likelihood receiver with reliable estimates of the (possibly time-varying) MIMO channel, without reducing the conveyed information throughput. Hence, after evaluating the performance of the proposed transceiver via a suitable version of the Union-Chernoff Bound, we introduce a novel family of unitary orthogonal Space-Times Block Codes (e.g., the Space-Time OPPM codes), that are able to attain both maximum diversity and coding gains. Afterwards, we present closed-form formulas for evaluating the SNR loss induced by mistiming effects possibly impairing the received signals. Lastly, we report several numerical results supporting both the medium/long coverage ranges attained by the proposed transceiver in outdoor applications and its performance robustness against correlated channel fading, mistiming effects and degradation induced by dense-multipath fading.
A Hybrid Multi-objective Evolutionary Algorithm and Its Application in Component-based Product Design
Authors: Xiangwei Zheng, Huichuan Duan, Hong Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Component-based product design usually appears as a multi-objective optimization problem (MOP). Traditional methods solving MOPs are robust and have proven their effectiveness in handling many classes of optimization problems. However, such techniques can encounter difficulties such as getting trapped in local minima, increasing computational complexity, and not being applicable to certain classes of objective functions. Multi-Objective Evolutionary Algorithms (MOEAs) can overcome these disadvantages and have shown great potentials to solve MOPs. In this paper, an h-MOEA is proposed by employing effective strategies from evolutionary computation, which is suitable for solving the MOP in design optimization and can generate more diverse solutions in an accepted time span. Then, the effectiveness and correctness of h- MOEA is verified using several popular benchmark functions. Also, a prototype is developed and used in component-based product design optimization. Finally, the optimization results of a product design case are shown in detail.
A Clustering Algorithm Based on Improved Minimum Spanning Tree
Authors: Zhiqiang Xie, Liang Yu, Jing Yang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The algorithms of data mining need better efficiency as data scale becomes larger and larger and the dimension of data is more. Aiming at the lower efficiency of the former MST (minimum spanning tree) clustering algorithm based on gene expression, a modified IMST (improved minimum spanning tree) clustering algorithm applied to common problem is brought forward. The analyzing of theory and example show that new IMST clustering algorithm can enhance the efficiency of constructing spanning tree and can solve sorting problem for shorter edges of clustering in minimum spanning trees. At last, both the efficiency of clustering and its effect are improved whole.
Architecture of a Programmable Digital Signal Processor
Authors: R. R. Shively
Venue: IEEE Transactions on Computers (1982)

The architecture of a programmable signal processor designed at Bell Laboratories is described.
Message from the Chairs
Authors: A. Grimshaw, M. Parashar, K. Schwan
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

The following topics are dealt with: high performance distributed computing; grid services; application environments; runtime; data management; resource management; scheduling; security policy; middleware; and system services.
Empirical-based recovery and maintenance of input error-correction features
Authors: Minh Ngoc Ngo, Hee Beng Kuan Tan
Venue: Journal of Software Maintenance and Evolution: Research and Practice (2007)

Most information systems deal with inputs submitted from their external environments. In such systems, input validation is often incorporated to reject erroneous inputs. Unfortunately, many input errors cannot be detected automatically and therefore result in errors in the effects raised by the system. Therefore, the provision of input error-correction features (IECFs) to correct these erroneous effects is critical. However, recovery and maintenance of these features are complicated, tedious and error prone because there are many possible input errors during user interaction with the system; each input error, in turn, might result in several erroneous effects. Through empirical study, we have discovered some interesting control flow graph patterns with regard to the implementation of IECFs in information systems. Motivated by these initial findings, in this paper, we propose an approach to the automated recovery of IECFs by realizing these patterns from the source code. On the basis of the recovered information, we further propose a decomposition-slicing technique to aid the maintenance of these features without interfering with other parts of the system. A case study has been conducted to show the usefulness of the proposed approach. Copyright &copy; 2007 John Wiley & Sons, Ltd.