ppxscal/embedding_network huggingface dataset:
A Framework for Virtual Community Business Success: The Case of the Internet Chess Club
Authors: Mark Ginsburg, Suzanne Weisband
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Prior work has identified, in piecemeal fashion, desirable characteristics of Virtual Community businesses (VCBs) such as inimitable information assets, persistent handles fomenting trust, and an economic infrastructure. The present work develops a framework for the success of a subscription-based VCB by taking into account the above elements and considering as well an interplay of the membership (both regular members and volunteers), technical features of the interface, and an evolutionary business model that supports member subgroups as they form.Our framework is applied by an in-depth survey of use and attitude of regular members and volunteers in the Internet Chess Club (ICC), a popular subscription-based VCB.. The survey results reveal that key features of the model are supported in the ICC case: member subgroups follow customized communication pathways; a corps of volunteers is supported and recognized, and the custom interface presents clear navigation pathways to the ICC's key large-scale information asset, a multi-million game database contributed by real-world chess Grandmasters who enjoy complimentary ICC membership.We conclude by discussing VCBs in general and how the framework might apply to otherdomains.
Interest Management in Agent-Based Distributed Simulations
Authors: Lihua Wang, Stephen John Turner, Fang Wang
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

Distributed simulation enables participants situated in different geographical locations to share a common virtual world, which is called a Distributed Virtual Environment (DVE). Among the different research topics concerned with DVEs, there is a current trend of linking Multi-Agent systems and DVEs together. With the properties of autonomy, social ability, reactivity and proactiveness, agents can be used to represent entities in DVEs, where fast and accurate decision making is a determining factor of the whole environment.This paper provides a description of integrating agents into an HLA-based distributed simulation. It focuses on how to construct the sensor of an agent with different interest management schemes. Using the JADE (Java Agent DEvelopment Framework) agent toolkit and the High Level Architecture (HLA) in our prototype, a minesweeping game, we outline two different implementations of this game. Due to the dynamic characteristics of agents, a problem of overdue information from the environment is discussed, and we propose an enlarged subscription region method to solve this problem. Moreover, advisories provided by the HLA are adopted to reduce the overheads. Conclusions are drawn based on the experimental results of these implementations.
New methods for parallel discrete event simulation
Authors: Boleslaw K. Szymanski
Venue:  (2003)

This thesis makes two contributions in the area of Parallel Discrete Event Simulation. Firstly, a component-oriented simulation world-view is proposed in which a simulation is viewed as a composition of components. The proposed component-port model enforces such a world-view by classifying components into time-independent, time-aware, and autonomous components, and by classifying ports into serial, virtual, and lookback ports. Secondly, a component property named lookback is identified that enables a new class of PDES synchronization protocols. Lookback has proven to be more commonly present that lookahead, the basis for traditional conservative PDES synchronization protocols. Moreover, lookback-based protocols are shown to be capable of completing the simulation earlier than the limit imposed by the critical times of events, which is an insurmountable bound for traditional conservative protocols and optimistic protocols without optimization. Furthermore, it has been demonstrated that lookback can also be exploited in optimistic simulation to reduce the number of rollbacks and anti-messages.
The Stabilizability and Connections between Internal and BIBO Stability of 2-D Singular Systems
Authors: Weiqun Wang, Yun Zou
Venue: Multidimensional Systems and Signal Processing (2004)

The problem of stabilizability of 2-D singular systems is considered, a necessary and sufficient condition in terms of the existence of a polynomial solution to a Bezout identity has been generalized from 2-D regular systems to the singular case. The BIBO stability condition has been extended to 2-D singular systems. The detectability of 2-D singular system is further discussed, an equivalent condition is obtained. At last it is shown that 2-D singular system is internally stable if and only if it is BIBO stable, detectable and stabilizable.
Special Issue: Configuration Design
Authors: Timothy Darr, Mark Klein, Deborah L. McGuinness
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

In configuration design parts are selected and connected to meet customer specifications and engineering and physical constraints. Specifications include preferences (e.g., &ldquo;prefer lower cost to higher performance, all things being equal&rdquo;), bounds on various resources (e.g., &ldquo;the computer should have four PCI slots&rdquo;), and other information to customize a configuration. Constraints typically arise from exogenous concerns, such as the available parts, the way parts can interact, and the manufacturing plant.
Integrated TCP/IP Protocol Software Testing for Vulnerability Detection
Authors: Shu Xiao, Lijun Deng, Sheng Li, Xiangrong Wang
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Many security holes stem from the defects in network protocol implementations. This paper presents an industry best practice of integrated TCP/IP network protocol testing that targets software robustness vulnerabilities. The deployed test system consists of a versatile test engine, a protocol data unit generator and a few auxiliary tools. The specially designed kernel test engine supporting IP/TCP/UDP as carrier protocols drives predefined fault-injected PDUs to the network unit under test. Its novel callback mechanism and virtual network device connection capability cost-effectively enhance user controlled testing intelligence for verifyingprotocols with complicated state transitions. The PDU generator aims to provide a systematic solution for rapid testcase creation, which is based on new Strengthened BNF language for protocol specification mutation and fault injection. Established on this system, we propose anintegrated industry test environment for network protocol code assessment. Initial experiments and case studies with multicast protocols unveiled several robustness violations, which have significant security impacts.
A summarization system for Chinese news from multiple sources
Authors: Hsin-Hsi Chen, June-Jei Kuo, Sheng-Jie Huang, Chuan-Jie Lin, Hung-Chia Wung
Venue: Journal of the American Society for Information Science and Technology (2003)

This article proposes a summarization system for multiple documents. It employs not only named entities and other signatures to cluster news from different sources, but also employs punctuation marks, linking elements, and topic chains to identify the meaningful units (MUs). Using nouns and verbs to identify the similar MUs, focusing and browsing models are applied to represent the summarization results. To reduce information loss during summarization, informative words in a document are introduced. For the evaluation, a question answering system (QA system) is proposed to substitute the human assessors. In large-scale experiments containing 140 questions to 17,877 documents, the results show that those models using informative words outperform pure heuristic voting-only strategy by news reporters. This model can be easily further applied to summarize multilingual news from multiple sources.
FReCon: a fluid remote controller for a FReely connected world in a ubiquitous environment
Authors: Alexandre Sanguinetti, Hirohide Haga, Aya Funakoshi, Atsushi Yoshida, Chiho Matsumoto
Venue: Personal and Ubiquitous Computing (2003)

In this paper, we propose a Fluid Remote Controller, a general-purpose remote controller based on the ubiquitous computing view. FReCon offers remote control features over a wide range of appliances located within a room, with a unique controller implemented on portable devices like PDAs, handheld PCs, mobile phones, etc. More than the controller itself, FReCon means the whole FReely Connected world in which FReCon-enabled users and appliances interact: though acting naturally, the user can freely connect to the desired appliance, control it, disconnect from it and start communicating with another. A prototype implementation in the form of a smart TV remote controller is also described. This simple prototype makes it possible to understand the validity and the limits of our view, and give clues for further improvements.
A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem
Authors: Virginie Gabrel, Arnaud Knippel, Michel Minoux
Venue: Journal of Heuristics (2003)

In this paper, approximate solutions algorithms for discrete cost multicommodity network optimization problems are presented and compared. Firstly, extensions of classical greedy heuristics, based on link-rerouting and flow-rerouting heuristics, are presented in details. Secondly, a new approximate solution algorithm, which basically consists of a heuristic implementation of the exact Benders-type cutting plane generation method, is proposed. All these algorithms are extensively compared on randomly generated graphs up to 50 nodes and 90 links. It clearly appears that this new Benders-type approach is very promising since it produces the best heuristic solutions.
Sequential and multi-population memetic algorithms for assigning cells to switches in mobile networks
Authors: Alejandro Quintero, Samuel Pierre
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

The design of mobile networks is a complex process, which requires solving simultaneously many difficult combinatorial optimization problems. Assigning cells to switches in cellular mobile networks is an NP-hard problem, which can not be practically solved using exact methods. In this context, heuristic approaches like memetic algorithms (MAs) are recommended. This paper proposes different MAs to solve this problem. The implementation of these algorithms has been subject to extensive tests. The results obtained confirm the efficiency and the effectiveness of MA to provide good solutions for moderate- and large-sized cellular mobile networks, in comparison with standard genetic algorithm and with other heuristic methods well known in the literature.
Raw Relation Sets and Multiperson Decision Making
Authors: Yuxi Chen, Weiyi Meng
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

In this paper, Multiperson Decision Making is explored based on Raw Relation Sets [1], in which three types of basic order relationships between any two objects are used to define the order relationships among a set of objects. Different order relationships among the same set ofobjects may be produced by different evaluators (or evaluation criteria) and there is also an order relationship among the evaluators themselves. In this paper, all evaluators are assumed to be of the same importance. This method emphasizes using qualitative (or un-weighted) order relationships but it is also capable of handling weighted order relationships.
Visualization of association rules over relational DBMSs
Authors: Sharma Chakravarthy, Hongen Zhang
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

The focus of this paper is the association rule visualization system that we have designed and developed. The rules produced by the mining algorithm are assumed to be stored in tables. The alternatives for visualization include tabular form, interactive two-dimensional, and three-dimensional graphics. By providing sorting and filtering abilities, the rule visualization system proposed in this paper provides a flexible, efficient, and easier way to manage and understand large number of association rules. As a result, this visualization system becomes an essential part of our association rule mining subsystem. We compare our association rule software with Intelligent Miner from IBM in various aspects, such as data accessibility, user interface, input/output, and rule visualization.
X3D-edit authoring for extensible 3D (X3D) graphics
Authors: Don Brutzman
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

A primary benefit of the Extensible 3D (X3D) Graphics Specification is the use of the Extensible Markup Language (XML) to encode 3D scenes compatibly with the next-generation Web. XML-based languages provide a wide variety of new capabilities for authoring, processing and validating graphics scenes. X3D-Edit is an authoring tool for X3D scenes developed using IBM's Xeena, an XML-based tool-building application. Context-sensitive editing prevents creation of incorrect scene-graph structures and detects invalid numeric values. Context-sensitive tooltips provide concise explanations and warnings of each X3D node and field. Tooltip encoding in XML and internationalization (I18N) in Chinese, English, French, German and Spanish greatly broadens the potential authoring pool for X3D. Extensible Stylesheet Language for Transformation (XSLT) stylesheets provide rapid translation of XML-based X3D scenes into Virtual Reality Modeling Language (VRML) UTF-8 syntax or pretty-print HTML pages. Use by several dozen students and development of numerous examples has allowed us to teach X3D to nonprogrammers, produced over one thousand publicly archived scenes, and demonstrated excellent effectiveness for beginners and experts alike. The use of XML both for scene design and tool construction provides numerous benefits, including improved author productivity and content stability. These assets are available for direct integration by other X3D authoring and viewing environments.
Regression Testing for Web Applications Based on Slicing
Authors: Lei Xu, Baowen Xu, Zhenqiang Chen, Jixiang Jiang, Huowang Chen
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Web applications have rapid developing speed andchangeable user demands, so the regression testing ismuch important. Since the changed demands result indifferent versions of Web applications, and the faultsusually hiding in the adjusted contents, the regressiontesting must cover all the related pages. In order to carrythrough the regression testing quickly and effectively, wemake the simplification with the method of slicing. Firstly,we analyze the possible changes in the Web applicationsand the influences produced by these changes, discussingin the direct-dependent and indirect-dependent way; next,we give the regression testing method based on slicingemphasized on the indirect-dependent among data, i.e.,obtaining the dependent set of changed variables byForward and Backward Search Method and generatingthe testing suits; conclusion remarks and future work aregiven at last.
Learning rules for odour recognition in an electronic nose
Authors: Stephen A. McCoy, Trevor P. Martin, James F. Baldwin
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

The problem of automating the sensing and classification of odours is one which promises a wide range of industrial applications. During the INTESA project, a prototype electronic nose was developed, using sensors based on novel conducting polymer materials and also more traditional MOS materials. The software component of the prototype processes the transient resistance change signals recorded by the hardware, and classifies the odour sample into one of a number of "odour classes". This paper describes two of the soft computing methods investigated for learning classification rules in this domain. The first method builds on previous work done on the Fril data browser, using clustering, fuzzy matching, Fril rules and evidential logic rules. The second method uses a fuzzy extension of the ID3 decision tree induction method, called "mass assignment tree induction (MATI)". Some of the results of applying these methods to data obtained from the INTESA prototype are presented and discussed.
Data mining applied to in vitro fertilization, tumor and diabetic patient data
Authors: Oliver Hogl
Venue: ACM SIGBIO Newsletter (1998)

We currently develop a technology to combine knowledge acquisition from domain experts and data mining thus allowing an easy and focused approach to intelligent knowledge discovery. By enabling the domain expert to enter data mining queries in his/her domain terminology and by returning findings in the same terms as well as measuring the interestingness of findings, user support is provided throughout the knowledge discovery process. In the biomedical area a project on the discovery of interesting dependencies in patient data for the purpose of quality management has been carried out within several clinics. In this sector, data mining precedes confirmative analyses by generating first hypotheses. In addition to that, a number of studies concerning the analysis of medical data, e.g. in the fields of in vitro fertilization, classification of tumors, fusion of sensor data, and diabetic patient profiling have been worked on with local university hospitals. By fusing complex medical data from various Sources and analyzing them, new discoveries, e.g. decision trees for tumors, could be made.
Network Time Synchronization Using Clock Offset Optimization
Authors: Omer Gurewitz, Israel Cidon, Moshe Sidi
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

Time synchronization is critical in distributed environments. Avariety of network protcols, middleware and business applications rely on proper time synchronization across the computational infrastructure and depend on the clock accuracy. The "Network Time Protocol" (NTP) is the current widely accepted standard for synchronizing clocks over the internet. NTP uses a hierarchical scheme in order to synchronize the clocks in the network. In this paper we present a novel non-hierarchical peer-to-peer approach for time synchronization termed CTP - Classless Time Protocol. This approach exploits convex optimization theory in order to evaluate the impact of each clock offset on the overall objective function. We define the clock offset problem as an optimization problem and derive its optimal solution. Based on the solution we develop a distributed protocol that can be implemented over a communication network and prove its convergence to the optimal clock offsets. For compatibility, the CTP may use the exact format and number of messages used by NTP. We also present methodology and numerical results for evaluating and comparing the accuracy of time synchronization schemes. We show that the CTP substantially outperforms hierarchical schemes such as NTP in the sense of clock accuracy with respect to a universal clock, without increasing complexity.
Shared Semantic Domains for Computational Reliability Engineering
Authors: David Coppit, Robert R. Painter, Kevin J. Sullivan
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Modeling languages and the software tools which supportthem are essential to engineering. However, as theselanguages become more sophisticated, it becomes difficultto assure both the validity of their semantic specificationsand the dependability of their program implementations.To ameliorate this problem we propose to develop sharedsemantic domains and corresponding implementations forfamilies of related modeling languages. The idea is toamortize investments at the intermediate level across multiplelanguage definitions and implementations. To assessthe practicality of this approach for modeling languages,we applied it to two languages for reliability modeling andanalysis. In earlier work, we developed the intermediate semanticdomain of failure automata (FA), which we used toformalize the semantics of dynamic fault trees (DFTs). Inthis paper, we show that a variant of the original FA canserve as a common semantic domain for both DFTs and reliabilityblock diagrams (RBDs). Our experiences suggestthat the use of a common semantic domain and a sharedanalyzer for expressions at this level can ease the task offormalizing and implementing modeling languages, reducingdevelopment costs and improving their dependability.
A BIST-based Solution for the Diagnosis of Embedded Memories Adopting Image Processing Techniques
Authors: D. Appello, A. Fudoli, V. Tancorre, P. Bernardi, F. Corno, M. Rebaudengo, M. Sonza Reorda
Venue: Journal of Electronic Testing: Theory and Applications (2004)

This paper proposes a new solution for the diagnosis of faults into embedded RAMs, currently under evaluation within STMicroelectronics. The proposed scheme uses dedicated circuitry embedded in a BIST wrapper, and an ATE test program to schedule the data extraction flow and to analyze the gathered information. Testing is performed exploiting a standard IEEE 1149.1 TAP, which allows the access to multiple memory cores with a P1500 compliant solution. The approach aims at implementing a low-cost solution to diagnose embedded RAMs with the goal to minimize the ATE costs and the time required to extract the diagnostic information. In our approach, the ATE drives the diagnostic scheme and performs the classification of faults, allowing the adoption of low-cost equipments. The proposed solution allows a scalable extraction of test data, whose amount is proportional to the available testing time. In order to accelerate fault classification, image processing techniques have been applied. The Hough transform has been adopted to analyze the bitmap representing the faulty cells. Experimental results show the advantages of the proposed approach in terms of time required to complete the diagnostic process.
Tlahuilli-ce - A Novel Solar Energy Program for the Design of Photovoltaic Systems
Authors: Eduardo Díaz-Escobar, Liliana Díaz Olavarrieta
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

This paper introduces a novel software program forthe design of photovoltaic systems called TlahuilliceTM(Tlahuilli=Light, ce=1 in Nahuatl Language).In comparison to existing programs, it permits aneasier access to known algorithms for PhotovoltaicSystem Design, while at the same time being detailedenough for the feasibility & design dimensioning stagefor Autonomous or Stand Alone Photovoltaic Systems(Pumping as well as Residential & BuildingApplications) as well as Utility -Interactive SystemsConnected to the Electric Grid.The interface languagefor Tlahuilli-ceTM is Spanish, and it is a MicrosoftExcel & Microsoft Visual Basic application.TlahuilliceTMallows people that don't have experience in thesolar energy field to use it to achieve good designs.