ppxscal/embedding_network huggingface dataset:
Measurement of Level of Quality Control Activities in Software Development [Quality Control Scorecards]
Authors: Curtis (Jung-Soo) J. Kim, Sang-Min Kim, Ki-Won Song
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper presents the method of measuring level of quality control activities to ensure the quality of delivered software during the development cycle. Obviously, there are many key performance indexes derivable from the actual data associated with quality control activities and it is desirable to create a scorecard to integrally represent overall level of quality control activities performed while developing the software deliverables. With the score card, it ispossible to evaluate whether enough quality control activities are performed for the project officially and secure the quality of the software deliverables before it is delivered to the customers.
Agent-Based Traffic Control Using Auctions
Authors: Heiko Schepperle, Klemens Böhm
Venue: Proceedings of the 11th international workshop on Cooperative Information Agents XI (2007)

Traffic management nowadays is one of the key challenges for cities. One drawback of traditional approaches for traffic management is that they do not consider the different valuations of waiting-time reduction of the drivers. These valuations can differ from driver to driver, e.g., drivers who are late for their job interview have a higher valuation of reduced waiting time than individuals driving home from work routinely. This also applies to trucks with urgent load, e.g., as part of a just-in-time production chain. To overcome this problem, we propose a new mechanism for traffic control at intersections called Initial Time-Slot Auction that is valuation-aware. It relies on agent-based driver-assistance systems to allocate the right to cross an intersection. Our evaluation shows that it does yield a significantly higher overall satisfaction.
Two proposals for the inclusion of directory information in the last-level private caches of glueless shared-memory multiprocessors
Authors: Alberto Ros, Ricardo Fernández-Pascual, Manuel E. Acacio, José M. García
Venue: Journal of Parallel and Distributed Computing (2008)

In glueless shared-memory multiprocessors where cache coherence is usually maintained using a directory-based protocol, the fast access to the on-chip components (caches and network router, among others) contrasts with the much slower main memory. Unfortunately, directory-based protocols need to obtain the sharing status of every memory block before coherence actions can be performed. This information has traditionally been stored in main memory, and therefore these cache coherence protocols are far from being optimal. In this work, we propose two alternative designs for the last-level private cache of glueless shared-memory multiprocessors: the lightweight directory and the SGluM cache. Our proposals completely remove directory information from main memory and store it in the home node's L2 cache, thus reducing both the number of accesses to main memory and the directory memory overhead. The main characteristics of the lightweight directory are its simplicity and the significant improvement in the execution time for most applications. Its drawback, however, is that the performance of some particular applications could be degraded. On the other hand, the SGluM cache offers more modest improvements in execution time for all the applications by adding some extra structures that cope with the cases in which the lightweight directory fails.
An Operating System Architecture for Organic Computing in Embedded Real-Time Systems
Authors: Florian Kluge, Jörg Mische, Sascha Uhrig, Theo Ungerer
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

To overcome the rising complexity of computing systems, the paradigms of Autonomic Computing and Organic Computing have been introduced. By using an observer/controller architecture, Organic Computing aims to make embedded systems more life-like by providing them with so-called Self-X properties. Embedded real-time systems can also gain great benefit from these techniques. In this paper, we show what new requirements arise when introducing Autonomic/Organic Computing into the area of real-time applications. These requirements flow into the architecture of the real-time operating system CAROS. CAROS combines several concepts to provide a solid base for the implementation of Self-X techniques in embedded real-time systems. We show the practicability of our concepts with a prototypical implementation on the multithreaded CarCore microcontroller.
Business Process Regression Testing
Authors: Hehui Liu, Zhongjie Li, Jun Zhu, Huafang Tan
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Business Process Execution Language(BPEL) has been recognized as a standard for the service orchestration in Service Oriented Architecture(SOA). Due to the pivotal role played by BPEL in service composition, the reliability of a business process becomes critical for a SOA system, especially during its evolution.Regression testing is well known as an effective technology to ensure the quality of modified programs. To reduce the cost of regression testing, a subset of test cases is selected to (re)run, known as regression test selection. Previous work addressing this problem will fail in the presence of concurrent control flow, which is an important and widely used feature of BPEL in describing service orchestration. In this paper, a regression testing approach for BPEL business processes is presented. In this approach, an impact analysis rule is proposed to identify the test paths affected by the change of BPEL concurrent control structures. Based on the impact analysis result and process changes identification, the impacted test paths are classified into reusable, modified, obsolete and new-structural paths. Experiments show that our approach is feasible.
Solving two-person zero-sum repeated games of incomplete information
Authors: Andrew Gilpin, Tuomas Sandholm
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versus carefully concealing their information so as not to give up a long-term informed advantage. The theory of infinitely-repeated two-player zero-sum games with incomplete information has been carefully studied, beginning with the seminal work of Aumann and Maschler. While this theoretical work has produced a characterization of optimal strategies, algorithms for solving for optimal strategies have not yet been studied. For the case where one player is informed about the true state of the world and the other player is uninformed, we provide a non-convex mathematical programming formulation for computing the value of the game, as well as optimal strategies for the informed player. We then describe an efficient algorithm for solving this difficult optimization problem to within arbitrary accuracy. We also discuss how to efficiently compute optimal strategies for the uninformed player using the output of our algorithm.
Automatic Labeling System of Words in Text Materials for College English Tests
Authors: Hongqi Gong, Lihua Li, Hongyu Zhao
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

In compiling a summative test paper of college English, it is often necessary to prepare text materials of appropriate Reading Ease (RE). So far, most compilers have based their identification of the text RE upon estimates, resulting in an arbitrary level of text RE and hence compromising the authority of the test. With a pre-built Microsoft Access database of vocabulary as the criterion and taking advantage of the programming interface of Microsoft Word and the OLE technology and data access objects (DAO) of Visual Basic 6.0, a computer program system has been successfully written to automatically label the words in an English text in accordance with their bands designated by the College English Teaching Syllabus. A band-based statistical analysis of the words in the text is provided as well. The system paves the way for a future automatic identification of text material RE for college English tests.
An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description)
Authors: Rajeev Goré, Linda Postniece
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

Goré and Nguyen have recently given the first optimal and sound method for global caching for the description (modal) logic $\mathcal {ALC}$, and various extensions. We report on an experimental evaluation for $\mathcal {ALC}$ plus its reflexive and reflexive-transitive extensions which compares global caching, mixed caching, unsat caching and no caching, all in a single common framework implementing a depth-first search strategy. We also evaluated a version of global caching using an unrestricted search strategy which necessarily sits outside the common framework. We conclude that global caching is an improvement over the other methods in most but not all cases.
Investigations into the Effect of Multiobjectivization in Protein Structure Prediction
Authors: Julia Handl, Simon C. Lovell, Joshua Knowles
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Physics-based potential energy functions used in protein structure prediction are composed of several energy terms combined in a weighted sum. `Multiobjectivization' -- splitting up the energy function into its components and optimizing the components as a vector using multiobjective methods -- may have beneficial effects for tackling these difficult problems. In this paper we investigate the hypotheses that multiobjectivization can (i) reduce the number of local optima in the landscapes, as seen by hillclimbers, and (ii) equalize the influence of different energy components that range over vastly different energy scales and hence usually swamp each other's search gradients. The investigations use models of two real molecules, the alanine dipeptide and Metenkephalin under the Amber99 energy function, and consider hillclimbers with a range of mutation step sizes. Our findings support the hypotheses and also indicate that multiobjectivization is competitive with alternative methods of escaping local optima.
Increasing wireless revenue with service differentiation
Authors: Siamak Ayani, Jean Walrand
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

New technologies such as IEEE 802.16 (Wi-MAX) [2] and IEEE 802.11e (Wi-Fi with QoS) [1] enable differentiated services. In this study we explore the potential for increasing the revenue of Internet service providers with differentiated services. For concreteness, we focus on two generic services that we call "voice" and "data." However, the analysis applies to services that have different requirements such as video streaming and networked games. Using analytical models we examine the conditions under which the operator can improve his revenue with service differentiation. We verify the results using a simulation of a more complex model of the network.
Improved Curvature Scale Space Based on Image Retrieval Using Dynamic Time Warping
Authors: Sang Hee Kim, Youngsong Mun, Hyung Il Choi
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

In this paper, we suggest improved Improved Curvature Scale Space(ICSS) based on image retrieval using Dynamic Time Warping(DTW). This method consists of three process. At the first stage, we retrieved an image using ICSS method. We applied ICSS space to extract shape information. This method expressed contours of the object which is binarized through pre-process in ICSS space, then extract shape features of the object. At the second stage, we applied DTW for time series to determine similarities. DTW algorithm is good to find the optimal alignment between two time series. finally, merge ICSS shape feature with DTW information. This method is estimated with a database of 1000 images. With estimated result, we show that proposed method is better in accuracy of searching than without DTW.
Desirable Characteristics of Learning Companions
Authors: Yanghee Kim
Venue: International Journal of Artificial Intelligence in Education (2007)

This study investigated the desirable characteristics of anthropomorphized learning-companion agents for college students. First, interviews with six undergraduates explored their concepts of desirable learning companions. The interviews yielded agent competency, agent personality, and interaction control. Next, a controlled experiment examined whether learner competency (strong vs. weak) would relate directly to agent competency (high vs. low) and to interaction control (agent-control vs. learner-control). The dependent measures included learners' perceptions of agent functionality, their self-efficacy beliefs in the task, and their learning. The results indicated that academically strong students perceived the high-competent agent higher than the lowcompetent agent and showed higher self-efficacy beliefs in the task and recalled more after working with the high-competent agent. Academically weak students, by contrast, showed higher self-efficacy and recalled more after working with the low-competent agent. Also, academically strong students valued agent-control highly, but academically weak students valued learner-control. The strong students showed higher self-efficacy in agentcontrol but lower self-efficacy in learner-control than did the weak students. In general, the results indicated that the similarities of characteristics between an agent and a learner have positive impacts on learners' cognitive and affective attainments.
A DNA sticker algorithm for bit-substitution in a block cipher
Authors: Xiutang Geng, Linqiang Pan, Jin Xu
Venue: Journal of Parallel and Distributed Computing (2008)

To attack block cipher systems, it is inevitable to handle the bit-substitutions, such as S-box, cycle left shift, and expansion substitutions. In this paper, a DNA sticker algorithm for bit-substitution such as cycle left shift is proposed. The proposed algorithm requires two equal long memory strands. The first memory strand stores the original binary string, while the second memory strand stores the resulting binary string. With the proposed algorithm, cycle left shift is performed on a mass of equal long binary strings, and the computation complexity of the cycle left shift is O(n) for all n-bit binary strings. Furthermore, this work indicates that block cipher systems with a 64-bit key are perhaps insecure. This paper presents clear evidence of the ability of DNA computing to perform intractable computation problems.
Extraction of Opposite Sentiments in Classified Free Format Text Reviews
Authors: Dong (Haoyuan) Li, Anne Laurent, Mathieu Roche, Pascal Poncelet
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Most of the previous approaches in opinion mining focus on the classifications of opinion polarities, positive or negative, expressed in customer reviews. In this paper, we present the problem of extracting contextual opposite sentiments in classified free format text reviews. We adapt the sequence data model to text mining with Part-of-Speech tags, and then we propose a belief-driven approach for extracting contextual opposite sentiments as unexpected sequences with respect to the opinion polarity of reviews. We conclude by detailing our experimental results on free format text movie review data.
Grand Challenges in Information Security: Process and Output
Authors: Sean W. Smith, Eugene H. Spafford
Venue: IEEE Security and Privacy (2004)

Deployed technology thus illustrates, by example, that we haven't learned how to build systems that we can reasonably trust to work correctly despite adversarial action. Nevertheless, we rush headlong to move even more important processes into computing systems, and to make commodity computing systems more ubiquitous.
Static and metaprogramming patterns and static frameworks: a catalog. an application
Authors: Philipp Bachmann
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

The classic UNIX principle to write code that generates code instead of writing this code yourself [48, Chapters 1, 9] is experiencing a revival. Much research was done, the techniques are better understood now, and the generation tools were refined. This pattern catalog consists of adaptations of the Gang of Four design patterns [27] Abstract Factory, Adapter, Strategy, and Visitor to the metaprogramming level. It shows that replacing runtime polymorphism by static polymorphism helps to lift variation from the code level up to the meta level, where it might more naturally belong to. Some of the patterns proposed are especially useful for facilitating portable code. The patterns shown can be used to build static Frameworks [50]. A simple example is also presented. For all patterns proposed we identified usage examples in popular existing applications or libraries. Each pattern presentation is accompanied with an example. These examples show sample code in C++. The template metaprogramming capabilities of C++ [2, 17, 65] allow us to express both the program and the meta program in the same programming language.
Availability assessment for multivalent and multifunctional systems
Authors: Gabriela Tont, Dan George Tont
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The degree in which a system is operational in a given horizon of time is the key indicator of service quality perceived by business users. The availability of critical systems is a function of the system reliability, maintainability and accessibility of support resources. Based on a comparative analysis, selecting an adequate method of availability assessment requires typical structures identification, reliability indices characterization and evaluation of non-reliability impact of the parts on system availability. Frequently used, binomial method leads to optimistic results due to bivalent states of components (operating/fault). For serial or parallel reliability structures, a realistic evaluation of system availability is obtained by applying polynomial or direct analysis based on reliability block diagram. A complex structure implies a successive assessment of structural components allowed by Monte-Carlo simulation providing accurate indices values. The paper presents a method of availability evaluation using Monte-Carlo simulation techniques which allows a comparative analysis of component impact on the system availability.
Semantics based analysis and synthesis of web services and workflows
Authors: Arthur J. Bernstein, Radu Grosu
Venue:  (2007)

Web service technologies provide a standard platform based on which heterogeneous software applications can be integrated over the Internet. Web service protocols, such as WSDL, provide a standard way for software applications to communicate with each other. Web service orchestration languages, such as BPEL4WS, are proposed to specify business processes as workflows whose composite tasks are web services. In many cases, it is critical to verify the correctness of a business process before it is deployed, and it is also highly desirable that new business processes be automatically synthesized from available web services based on the business requirement. An abstract process model is introduced. The model restricts the data manipulation constructs in an abstract BPEL process. The restrictions permit a full description of a protocol while hiding computation details. A restricted abstract process can easily he converted into an abstract BPEL process or expanded into an executable process. A logic model is presented to formally specify the semantics of web services and workflows as abstract processes. A set of inference rules are established to deduce the strongest postcondition and weakest precondition of an abstract process. We demonstrate that the rules can be used for automatic inference due to the restriction on data manipulation capabilities in an abstract process. Based on this model, an algorithm is developed to automatically annotate the semantics and verify the correctness of workflows. An algorithm is developed to automatically synthesize a business process given its required semantics and a task library. The well-formedness of a task library is defined and the ranking assumption is introduced to simplify the synthesis procedure and guarantee its completeness. A prototype of the verification and synthesis system has been implemented and several business processes in the financial industry have been studied based on our approach. The model and algorithm is then extended to allow business rules to be specified and incorporated into the synthesis procedure.
A concise XML binding framework facilitates practical object-oriented document engineering
Authors: Andruid Kerne, Zachary O. Toups, Blake Dworaczyk, Madhur Khandelwal
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

Semantic web researchers tend to assume that XML Schema and OWL-S are the correct means for representing the types, structure, and semantics of XML data used for documents and interchange between programs and services. These technologies separate information representation from implementation. The separation may seem like a benefit, because it is platform-agnostic. The problem is that the separation interferes with writing correct programs for practical document engineering, because it violates a primary principle of object-oriented programming: integration of data structures and algorithms. We develop an XML binding framework that connects Java object declarations with serialized XML representation. A basis of the framework is a metalanguage, embedded in Java object and field declarations, designed to be particularly concise, to facilitate the authoring and maintenance of programs that generate and manipulate XML documents. The framework serves as the foundation for a layered software architecture that includes meta-metadata descriptions for multimedia information extraction, modeling, and visualization; Lightweight Semantic Distributed Computing Services; interaction logging services; and a user studies framework.
On the first place antitonicity in QL-implications
Authors: Y. Shi, B. Van Gasse, D. Ruan, E. E. Kerre
Venue: Fuzzy Sets and Systems (2008)

To obtain a demanded fuzzy implication in fuzzy systems, a number of desired properties have been proposed, among which the first place antitonicity, the second place isotonicity and the boundary conditions are the most important ones. The three classes of fuzzy implications derived from the implication in binary logic, S-, R- and QL-implications all satisfy the second place isotonicity and the boundary conditions. However, not all the QL-implications satisfy the first place antitonicity as S- and R-implications do. In this paper we study the QL-implications satisfying the first place antitonicity. First we establish the relationship between the first place antitonicity and other required properties of QL-implications. Second we work on the conditions under which a QL-implication generated by different combinations of a t-conorm S, a t-norm T and a strong fuzzy negation N satisfy the first place antitonicity, especially in the cases that both S and T are continuous. We further investigate the interrelationships between S- and R-implications generated by left-continuous t-norms on one hand and QL-implications satisfying the first place antitonicity on the other.