ppxscal/embedding_network huggingface dataset:
Alignment of Misuse Cases with Security Risk Management
Authors: Raimundas Matulevicius, Nicolas Mayer, Patrick Heymans
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

It is recognised that security has to be addressed through the whole system development process. However current practices address security only in late stages, i.e., development or maintenance. Due to the success of UML use cases, misuse cases have been accepted by industry as a means to tackle security. However misuse cases, firstly, lack a precise application process, secondly, are too general which results in under-definition or misinterpretation of their concepts. In this paper we examine misuse cases in the light of a reference model for information system security risk management (ISSRM). Using the well-known Meeting Scheduler example we show how misuse cases can be used to follow a security risk management process. Next we check the misuse case ontology according to the concepts found in current risk management standards. The paper suggests improvements for the conceptual appropriateness of misuse cases for the security risk domain.
Slede: a domain-specific verification framework for sensor network security protocol implementations
Authors: Youssef Hanna, Hridesh Rajan, Wensheng Zhang
Venue: Proceedings of the first ACM conference on Wireless network security (2008)

Finding flaws in security protocol implementations is hard. Finding flaws in the implementations of sensor network security protocols is even harder because they are designed to protect against more system failures compared to traditional protocols. Formal verification techniques such as model checking, theorem proving, etc, have been very successful in the past in detecting faults in security protocol specifications; however, they generally require that a formal description of the protocol, often called model, is developed before the verification can start. There are three factors that make model construction, and as a result, formal verification is hard. First, knowledge of the specialized language used to construct the model is necessary. Second, upfront effort is required to produce an artifact that is only useful during verification, which might be considered wasteful by some, and third, manual model construction is error prone and may lead to inconsistencies between the implementation and the model. The key contribution of this work is an approach for automated formal verification of sensor network security protocols. Technical underpinnings of our approach includes a technique for automatically extracting a model from the nesC implementations of a security protocol, a technique for composing this extracted model with models of intrusion and network topologies, and a technique for translating the results of the verification process to domain terms. Our approach is sound and complete within bounds, i.e. if it reports a fault scenario for a protocol, there is indeed a fault and our framework terminates for a network topology of given size; otherwise no faults in the protocol are present that can be exploited in the network topology of that size or less using the given intrusion model. Our approach also does not require upfront model construction, which significantly decreases the cost of verification.
Distributed decision evaluation model in public transportation systems
Authors: Imen Boudali, Inès Ben Jaafar, Khaled Ghedira
Venue: Engineering Applications of Artificial Intelligence (2008)

Due to several external and internal disturbances affecting public transportation systems, some regulation measures have to be undertaken. In the regulation process, the regulator has to evaluate a number of possible decisions in order to determine best compromise of some regulation criteria. The complexity of this task increases when numerous disturbances appear simultaneously and mainly when regulation criteria are contradictory. For these reasons, we propose in this paper a multi-agent model that deals with decision evaluation step as a multicriteria optimization problem. In this model, the best compromise is determined by means of the following concepts: Pareto optimality, a-efficiency and plurality voting. The process of the proposed approach is shown through an illustrative example.
An optimal control problem involving impulsive integrodifferential systems
Authors: C. Z. Wu, K. L. Teo, Yi Zhao, W. Y. Yan
Venue: Optimization Methods Software (2007)

In this article, we consider a class of optimal control problems involving dynamical systems described by impulsive integrodifferential equations. First, we approximate the integral kernel of the integral equation by a finite expansion of the shifted Chebyshev polynomial. Through this process, the optimal control problem is approximated by a sequence of optimal control problems involving only impulsive ordinary differential equations. Each of them can be viewed as a nonlinear optimization problem. For each of these approximated problems, the gradient formula of the cost functional can be derived and hence can be solved by many efficient optimization techniques. Consequently, the optimal control software, MISER, is applicable for the purpose. Then, we present some convergence results showing the relationship between the sequence of the optimal controls of the approximated problems and that of the original problem. Finally, a numerical example is presented to illustrate the efficiency of the proposed method.
Voice activity detection based on adjustable linear prediction and GARCH models
Authors: Hiroko Kato Solvang, Kentaro Ishizuka, Masakiyo Fujimoto
Venue: Speech Communication (2008)

We propose a method for voice activity detection (VAD) that employs a class of the Autoregressive-Generalized Autoregressive Conditional Heteroskedasticity (AR-GARCH) model. As regards correlated speech signals, we represent the AR part of the AR-GARCH model with a state-space to obtain the appropriate linear prediction error series. By applying the GARCH model to the residual, we estimate the conditional variance sequences corresponding to the voice activity parts. To detect voice activity, we establish an appropriate threshold for the conditional variance sequences. To confirm the performance of our proposed VAD method, we conduct experiments using speech signals with real background noise (signal-to-noise ratios (SNRs) of 10, 5 and 0dB) of an airport and a street. Furthermore, using receiver operating characteristics curves and equal error rates, we compare our results with those of previous standardized VAD algorithms (ITU-T G.729B, ETSI ES 202 050, and ETSI EN 301 708) as well as recently developed methods (VAD with long-term spectral divergence, likelihood ratio tests, and higher-order statistics for VAD). In terms of the signals with background noise at an SNR of 0dB, the experimental results show a significant performance improvement compared with standardized VAD algorithms and more than 10% improvement compared with recently developed VAD methods.
Non-linear dynamic behavior of thin rectangular plates parametrically excited using the asymptotic method, part 1: computation of the amplitude
Authors: Mihai Bugaru, Ovidiu Vasile
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

The paper reveals recent developments of the influence of the geometric imperfections on the amplitude of the non-linear vibrations of thin rectangular plates parametrically excited. In the region of principal parametric resonance, starting from the temporal non-linear differential equation that describes the oscillatory movement and using the second order approximation of the asymptotic method was computed the amplitude as function of system parameters and geometric imperfections. By varying the intensity of the geometric imperfections was obtained their influence upon the amplitude for the stationary non-linear dynamic response.
Error analysis in particle filter-based estimation of symbols transmitted over a time varying frequency flat fading channel
Authors: Sumakanth S. Kambhampati, K. R. Namuduri, Athanasios V. Vasilakos
Venue: International Journal of Autonomous and Adaptive Communications Systems (2008)

This article investigates particle filtering-based estimation of symbols transmitted over a time varying frequency flat fading channel with known autoregressive parameters. We introduce a metric that quantifies the error between the true and approximate posterior density functions and derive an upper bound for this metric.
Cross-Correlated FEC Scheme for Multimedia Streaming over Wireless LAN
Authors: Eunyong Park, Sunyoung Han, Heemin Kim, Kiwon Son
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The recent video standards like MPEG-4 are generally vulnerable to the packet loss because they achieve high compression ratios by complex calculation of preceding and succeeding frames. But, in the wireless channel, errors tend to occur in burst due to the intrinsic wireless link characteristics. Therefore, an efficient error control mechanism for multimedia streaming is necessary. In this paper, we propose a novel CC-FEC (Cross-correlated Forwarding Error Correction) scheme robust against burst error and suitable for multimedia streaming over the WLAN. The proposed scheme takes advantage of the interleaving and the multi-dimensional FEC schemes. We verify our scheme’s superior performance than other FEC schemes through simulation.
Covering polygons is hard
Authors: J. C. Culberson, R. A. Reckhow
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

It is shown that the following minimum cover problems are NP-hard, even for polygons without holes: (1) covering an arbitrary polygon with convex polygons; (2) covering the boundary of an arbitrary polygon with convex polygons; (3) covering an orthogonal polygon with rectangles; and (4) covering the boundary of an orthogonal polygon with rectangles. It is noted that these results hold even if the polygons are required to be in general position.
Evaluation of a web based mathematics teaching material on the subject of functions
Authors: Adnan Baki, Ebru Güveli
Venue: Computers Education (2008)

The aim of the study is to develop a web-based mathematics teaching (WBMT) material and to evaluate the effectiveness of the WBMT material for 9th grade students learning the concept of mathematical function. Firstly, a WBMT material was designed and piloted. As a result of this pilot study the site was revised as a final form. The study was conducted during the fall term of 2004-2005 academic years and was carried out in two different classes taught by the same teacher. Through mixed methods study the qualitative and quantitative data were collected from the sample, consisting of eighteen teachers and eighty 9th grade students. One of these teachers taught the control and experimental groups at the high school where the main study was conducted. This examination included comparing the results of students experiencing learning with WBMT with those do not, and interpreting the teachers' responses to the use of WBMT materials. The analysis of the data suggests positive effect of WBMT on student learning of mathematical function and on attitudes towards WBMT. However, the teachers all represented and shared some common ideas that because of the technical problems and readiness of teachers and students there would be some problems in terms of successful implementation of WBMT in schools. Nevertheless, the results provide support for the use of this WBMT material as a complement to traditional classes.
Temporal Routing Metrics for Networks with Advance Reservations
Authors: Christoph Barz, Markus Pilz, André Wichmann
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Usually, dynamic routing metrics consider the instantaneous load and the static structure of a network to determine an optimal path. This paper proposes an extension of the path selection process that is imposed by advance reservations. In the scope of scheduling Grid workflows advance reservations are likely to become a cornerstone which introduces temporal aspects. The focus of this paper is to extend the concept of dynamic routing with the notion of time. This paper classifies and proposes specific temporal routing metrics and presents ways to integrate these metrics into routing algorithms.
Answering common questions about code
Authors: Thomas D. LaToza
Venue: Companion of the 30th international conference on Software engineering (2008)

Difficulties understanding update paths while un-derstanding code cause developers to waste time and insert bugs. A detailed investigation of these difficulties suggests that a wide variety of problems could be addressed by more easily answering questions about update paths that existing tools do not answer. We are designing a feasible update path static analysis to compute these paths and a visualization for asking questions and displaying results. In addition to grounding the questions we answer and tailoring the program analysis in data, we will also evaluate the usefulness of our tool using lab and field studies.
Mobile sales assistant: NFC for retailers
Authors: Florian Resatsch, Stephan Karpischek, Uwe Sandner, Stephan Hamacher
Venue: Proceedings of the 9th international conference on Human computer interaction with mobile devices and services (2007)

The Mobile Sales Assistant helps retailers and customers to check the availability of articles with any NFC enabled mobile phone at the Point of Sale. The application uses NFC tags attached to products or to warehouse shelves to identify the articles by Electronic Product Code (EPC). It sends a request containing EPC to a server application which is connected to the local and company-wide Enterprise Resource Planning (ERP) system. Information about the article is sent to the mobile phone display. This makes the shopping experience for the customer faster and more convenient.
The internet diary: challenges and activities in next-generation internet design
Authors: Christian Vogt, Charles E. Perkins
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

This is the first in a new series of reports on selected activities from the Internet Engineering and Research Task Forces, IETF and IRTF. This issue focuses on IP mobility, routing in mobile ad-hoc networks, routing scalability, and transition from IP version 4 to version 6. Principal in IP mobility is the impending publication of the NETLMM working group's Proxy Mobile IPv6 protocol, as well as the creation of the new MEXT working group for maintenance and extension of (non-proxy) Mobile-IPv6-based protocols. Two second-generation routing protocols for ad-hoc networks are being completed in the MANET working group. Engineering of IP auto-configuration mechanisms for ad-hoc networks has stalled in the Autoconf working group due to the inappropriateness of the subnet-oriented IP addressing model in less structured mobile ad-hoc networks. Routing scalability is the main focus of the Routing research group from IRTF. The group is set to develop a recommendation on how to mitigate the critical growth in routing table size and update frequency. The v6ops working group is redesigning its IPv4/IPv6 protocol translator to provide operators with an urgently needed tool for interworking between IP versions.
Reinforcement learning with limited reinforcement: using Bayes risk for active learning in POMDPs
Authors: Finale Doshi, Joelle Pineau, Nicholas Roy
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Partially Observable Markov Decision Processes (POMDPs) have succeeded in planning domains that require balancing actions that increase an agent's knowledge and actions that increase an agent's reward. Unfortunately, most POMDPs are defined with a large number of parameters which are difficult to specify only from domain knowledge. In this paper, we present an approximation approach that allows us to treat the POMDP model parameters as additional hidden state in a "model-uncertainty" POMDP. Coupled with model-directed queries, our planner actively learns good policies. We demonstrate our approach on several POMDP problems.
SE-CSE 2008: the first international workshop on software engineering for computational science and engineering
Authors: Jeffrey C. Carver
Venue: Companion of the 30th international conference on Software engineering (2008)

Computational Science and Engineering (CS&E) software supports a wide variety of domains including nuclear physics, crash simulation, satellite data processing, fluid dynamics, climate modeling, bioinformatics, and financial modeling. The recent increase in the importance of this type of software motivates the need to better understand how it is developed. This movement creates an opportunity for the software engineering community to apply our techniques and knowledge to a new and important application domain. Furthermore, the design, implementation, and maintenance used in CS&E software systems can be significantly different from that used in systems more typically studied by the software engineering community. This workshop brings together researchers from the software engineering community with researchers and practitioners from the CS&E community. The workshop allows participants to share perspectives and present findings from research and practice that are relevant to the CS&E application development. A significant portion of the workshop is devoted to discussion of the position papers with the goal of generating a research agenda to improve tools, techniques, and experimental methods for CS&E software engineering in the future.
Advances in low power verification
Authors: Janick Bergeron
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Low Power design has traditionally been the area of Implementation engineers. However, with more and more advanced SOCs having to adopt aggressive Power Management techniques, the verification of these architectures has become an explosive problem. This talk will focus on the basic technology shifts required in the arena of verification - in dynanamic, static and formal analysis, in the area of Verification Methodology, Languages and Protocols and in next generation automation flows. The talk will also highlight some of the unsolved problems of today's technology and potential areas for research/collaboration between academia and industry.
Superjunction LDMOS on thick-SOI technology for RF applications
Authors: I. Cortés, P. Fernández-Martínez, D. Flores, S. Hidalgo, J. Rebollo
Venue: Microelectronics Journal (2008)

The feasibility of applying the superjunction (SJ) concept to a thick-SOI LDMOS transistor for RF base station applications is studied in this paper. The electrical performances of SJ thick-SOI LDMOS transistors are compared with those of the conventional RF LDMOS counterparts through an extensive 3D simulation work in terms of transconductance (g"m), specific-on resistance (R"O"N), voltage capability (V"B"R) and C-V characteristics. It is expected that SJ thick-SOI LDMOS structures will exhibit a significant R"O"N reduction thanks to the N-doping concentration increment in the drift region. The charge balance in structures integrated on thick-SOI substrates with a P-type epitaxial layer requires a fit of the N and P pillar doping concentration, being the P pillar slightly lower doped than the N one. Variation of pillars doping concentrations is directly related to the device performance. Therefore, the R"O"N/V"B"R trade-off and the R"O"N components and the C"g"d evolution are shown as a function of pillar doping ratio.
Tsunami damage assessment: a case study in Car Nicobar Island, India
Authors: A. Kumar, R. K. Chingkhei, Th. Dolendro
Venue: International Journal of Remote Sensing (2007)

The present studies deal with the tsunami damage assessment of the 26 December 2004 tsunami that occurred as a result of an Indonesian earthquake (Mw9.3) on Car Nicobar Island. Remote Sensing and GIS techniques are used to identify and assess the damage caused by the tsunami. The IRS 1D LISS III (Pre) and IRS P-6 (Post) satellite data are used in analysing the tsunami height, run-up elevation, water-flow direction, inundation distance, sand deposition, coastal response, subsidence and erosion hazards, and overall assessment of damage. In order to confirm the results of the analysis, an extensive field survey was conducted on the island. The analysis reveals that the tsunami height was 0.7-15 m on the beaches. The run-up level was 2-19 m with an inundation distance of 295.87-1202.57 m from the shoreline. The sand deposits at Aukchung and Arong beaches were 2.5 m and 1.0 m, respectively. The coastal subsidence at Malacca beach was 0.75-1.12 m, with significant coastal modification at various places.
Beyond Brute Force: Testing Financial Software
Authors: Mikhail Kharlamov, Alexey Polovinkin, Ekaterina Kondrateva, Alexey Lobachev
Venue: IT Professional (2008)

Testing financial software's functionality requires deep subject expertise and an understanding of quality assurance methods and processes. Thorough domain analysis, efficient test designs, specific methods, and well-prepared quality assurance staff are key elements for success.
An Efficient Real-Time Disk-Scheduling Framework with Adaptive Quality Guarantee
Authors: Cheng-Han Tsai, Tai-Yi Huang, Edward Chu, Chun-Hang Wei, Yu-Che Tsai
Venue: IEEE Transactions on Computers (2008)

A multimedia server requires a real-time disk-scheduling algorithm to deliver isochronous data for real-time streams. Traditional disk-scheduling algorithms focus on providing good quality in a best-effort manner. In this paper, we propose a novel real-time disk-scheduling algorithm called WRRSCAN (Weighted-Round-Robin-SCAN) to provide quality guaranty for all in-service streams encoded at variable bit rates. WRR-SCAN uniquely adopts the concept of imprecise computation to divide a real-time stream into mandatory jobs and optional jobs. The admission control admits a stream as long as its mandatory jobs are guaranteed to meet their deadlines. Such a decision is made in O(1) time as WRR-SCAN reserves a fixed weight for each stream. WRR-SCAN incorporates an aggressive policy to dynamically reclaim reserved-but-unused bandwidth during run-time. The reclaimed bandwidth is used to serve optional jobs for better quality or aperiodic jobs for reduced response time. We conducted a set of experiments to compare WRR-SCAN with a couple of representative and referred disk-scheduling algorithms. The evaluations are conducted on a commonly-used disk simulator with traces from a real multimedia server. The experimental results show that WRR-SCAN completes significantly more disk jobs and yields considerably better quality for real-time streams.