02546nas a2200133 4500008004100000245012300041210006900164260001200233300001000245490000700255520208600262100001702348856004702365 2024 eng d00aPredicting the Productivity of China’s Building Sector and the Elements that Affect it Using the DEA-Tobit Framework0 aPredicting the Productivity of China s Building Sector and the E c06/2024 a46-550 v223 a

The total output value of the construction industry, a pillar industry of China, is continuously growing with the expansion of the production and operation scale of Chinese construction enterprises. The extensive high-input mode has promoted the economic growth of the construction industry. Despite the fruitful and outstanding results, production inefficiency has become especially prominent. Though developing rapidly, China’s construction industry possesses fewer ecological investments, accompanied by low environmental awareness and little importance to environmental protection, constantly failing to eliminate high energy consumption, high investments, and high emissions. In addition, the contradiction between the economic growth of the construction industry and the ecological environment remains evident. In this paper, the production efficiency of China’s construction industry was transversely and longitudinally measured using the DEA-Malmquist index method, followed by a further analysis of the factors influencing the production efficiency of China’s construction industry based on the Tobit regression model. The results show that the average production efficiency of China’s construction industry is the highest in the East, moderate in the West, and lowest in the centre. The number of construction enterprises, per capita capital, industrial structure, the proportion of state-owned capitals, and GDP are significant at 1%, 10%, 1%, 1%, and 1%, respectively. The research results can provide theoretical reference for reasonably establishing an ecological efficiency evaluation system for the construction industry to analyze the differences in environmental efficiency among different provinces and regions, further find out the key factors influencing ecological efficiency, propose the corresponding pertinent policy suggestions, and ultimately improve the ecological efficiency of China’s construction industry.

1 aCheng, Guang uhttp://www.dline.info/download.php?sn=405302411nas a2200145 4500008004100000245009900041210006900140260001200209300001000221490000700231520192900238100001802167700002402185856005602209 2024 eng d00aPredictive Modeling of Stock Price Trends Using Machine Learning and Deep Learning Techniques-0 aPredictive Modeling of Stock Price Trends Using Machine Learning c09/2024 a83-900 v223 a

:Predicting stock price movements has been challenging yet crucial for investors and financial ana- lysts. Fluctuations in stock prices are valuable economic indicators, providing insights into overall economic well- being, consumer confidence, and market sentiment. In this study, we evaluate the efficacy of three different ma- chine and deep learning algorithms in anticipating stock price trends. We assess the performance of Logistic Re- gression, Random Forest Regression, and Long Short- Term Memory (LSTM) algorithms in forecasting whether a stock's price will rise or fall in the upcoming period, utilising historical stock price data as input features. Our findings demonstrate that while each algorithm exhibits varying degrees of predictive accuracy, LSTM networks stand out as they generally outperform Logistic Regression and Random Forest Regression in capturing the complex tem- poral dependencies inherent in stock price data. This suggests that LSTM networks, with their superior perfor- mance, hold significant promise as effective tools for stock price trend prediction, particularly in volatile and non-lin- ear financial markets. This could be a game-changer in stock price prediction, instilling optimism about the fu- ture of stock market analysis..

1 aKiruthika, K.1 aSamundeeswari, E.S. uhttp://www.dline.info/jdim/wp-content/uploads/1.pdf00989nas a2200133 4500008004100000245006600041210006600107260001200173300001000185490000700195520057700202100002900779856004700808 2022 eng d00aPublic Key Cryptosystem and Binary Edwards Curves on the Ring0 aPublic Key Cryptosystem and Binary Edwards Curves on the Ring c03/2022 a25-300 v203 a

 Let be a finite ring of characteristic 2, where e2 = e and n is a positive integer. Let (a, d) 2 ( )2, such that a and d + a2 + a are invertible in , we study the binary Edwards curve over this ring, denoted by and we give a bijection between this curve and produces two binary Edwards curves defined on the finite field . Afterthat we study the addition law of binary Edwards curves over the ring . We end this work with cryptography applications, ElGamal twisted Edwards curve cryptosystem and Cramer-Shoup twisted Edwards curve cryptosystem.

1 aElhamam, Moha, ben taleb uhttp://www.dline.info/download.php?sn=345001465nas a2200157 4500008004100000245009200041210006900133260001200202300001200214490000700226520095500233100001801188700002501206700002001231856005601251 2019 eng d00aPrediction of Reviews Rating: A Survey of Methods, Techniques and Hybrid Architectures-0 aPrediction of Reviews Rating A Survey of Methods Techniques and  c06/2019 a164-1780 v173 a

 In the last recent years, the customer reviews has attracted an increasing interest by researchers and companies thanks to the advancement in E commerce and business applications. The ability to successfully decide whether a review will be helpful to other customers and thus give the product more exposure is vital to companies that support these reviews, companies like Google, Amazon and Yelp! The problem is that some customers are giving rating in conflict with their comments obliging other reviewers to read the comments to understand the reason of this contradiction. Sentiment analysis is the process of automatically identifying opinions expressed in text on certain subjects. The accuracy of sentiment analysis has a direct effect on decision making in both business and government. Also, recommender system is one of the hot topics in the field of big data, especially with the development and growth of the World Wide Web.

1 aHarrag, Fouzi1 aAlsalman, Abdulmalik1 aAlqahtani, Alaa uhttp://dline.info/fpaper/jdim/v17i3/jdimv17i3_5.pdf01943nas a2200181 4500008004100000245006500041210006400106260001200170300001200182490000700194520140700201100003101608700001901639700002101658700002101679700000501700856005601705 2018 eng d00aParking System Development Using Extreme Programming Method-0 aParking System Development Using Extreme Programming Method c12/2018 a279-2880 v163 a

 In developing cities such as in Jakarta, there are a lot of vehicle parking locations that still use conventional methods, which can harm drivers and also parking area owners alike, the process is slow and unsafe, making many people around feel afraid to use parking locations that are still conventional, the conventional parking lots in Jakarta is too many, sometimes also make people have no other choice but to use unsecured parking lots, theft is the main factor that is difficult to avoid, especially in developing countries like Indonesia, which are not safe, and the location of the parking lot that is very open, makes a lot of opportunities which of course can be used by thieves or irresponsible people. Not only thieves, drivers who do not want to pay for parking, are also a problem for owners of parking lots. With the problems of these users, we plan to make modular parking applications that can be installed easily and cheaply, but because our group is not so large, there are several challenges that we face, such as time and requirements that can increase later, with thus we plan to make this parking application using the Extreme Programming method, which is possible and very suitable for the problems that our group is facing. The use of Extreme Programming turned out to be very helpful, and can also produce an application that matches the existing user stories.

1 aAndry, Johannes, Fernandes1 aJuliawan, Gary1 aChristian, Yosua1 aLeonardo, Jeffry1 a uhttp://dline.info/fpaper/jdim/v16i6/jdimv16i6_1.pdf00518nas a2200169 4500008004100000245006400041210006400105260001100169300000800180490000700188100003100195700001900226700002100245700002100266700000500287856005600292 2018 eng d00aParking System Development Using Extreme Programming Method0 aParking System Development Using Extreme Programming Method c122018 a2880 v161 aAndry, Johannes, Fernandes1 aJuliawan, Gary1 aChristian, Yosua1 aLeonardo, Jeffry1 a uhttp://dline.info/fpaper/jdim/v16i6/jdimv16i6_1.pdf00481nas a2200133 4500008004100000245012600041210006900167260001200236300001000248490000600258100001800264700002800282856003700310 2018 eng d00aPerformance Measure and Analysis of MPLS and conventional IP network through VoIP: Effect in Video and Audio transmission0 aPerformance Measure and Analysis of MPLS and conventional IP net c06/2018 a56-650 v91 aOubaha, Jawad1 aEz-zahout, Abderrahmane uhttps://dline.info/newl/node/66800419nas a2200133 4500008004100000245007000041210006800111260001200179300000900191490000600200100002000206700002200226856003700248 2018 eng d00aPlay-driven Design: Model for Engaging Person as in Content Sites0 aPlaydriven Design Model for Engaging Person as in Content Sites c03/2018 a7-150 v81 aPúblio, Angelo1 aNesteriuk, Sergio uhttps://dline.info/newl/node/64000366nas a2200121 4500008004100000245006000041210005900101260001200160300001000172490000600182100001900188856003700207 2018 eng d00aPrivate Cloud for College: Architecture and Possibility0 aPrivate Cloud for College Architecture and Possibility c02/2018 a13-170 v91 aAlnuaimi, Saif uhttps://dline.info/newl/node/66000506nas a2200133 4500008004100000245008300041210006900124260000900193300001400202490000700216100001700223700001400240856011800254 2016 eng d00aPlagiarism detection in Arabic documents: Approaches, architecture and systems0 aPlagiarism detection in Arabic documents Approaches architecture c2016 a124 - 1350 v141 aKahloula, B.1 aBerri, J. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84974801172&partnerID=40&md5=5284a71ab939f31aa1edb2b12f37113400483nas a2200121 4500008004100000245008700041210006900128260000900197300001400206490000700220100001600227856011800243 2015 eng d00aPaper hijacking: Hijackers are attacking journals for hijacking unpublished papers0 aPaper hijacking Hijackers are attacking journals for hijacking u c2015 a306 - 3070 v131 aDadkhah, M. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942516743&partnerID=40&md5=7f7001b6621fbfce1e57b4250206d07000586nas a2200169 4500008004100000245009600041210006900137260000900206300001400215490000700229100001200236700001100248700001300259700001300272700001300285856011800298 2015 eng d00aPower station flue gas desulfurization system based on automatic online monitoring platform0 aPower station flue gas desulfurization system based on automatic c2015 a480 - 4880 v131 aLiu, X.1 aMa, C.1 aYang, X.1 aYang, C.1 aDiao, Y. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84959194530&partnerID=40&md5=412732dc4426687d89037ffb1fe2083700656nas a2200157 4500008004100000245016700041210006900208260000900277300001400286490000700300100002000307700002200327700001500349700001600364856011800380 2015 eng d00aProviding mobile traffic analysis as-a-Service: Design of a service-based infrastructure to offer high-accuracy traffic classifiers based on hardware accelerators0 aProviding mobile traffic analysis asaService Design of a service c2015 a256 - 2650 v131 aBarbareschi, M.1 aDe Benedictis, A.1 aMazzeo, A.1 aVespoli, A. uhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84942523467&partnerID=40&md5=be532781710ddddfc3aa468942d2fc7601246nas a2200193 4500008004100000245010200041210006900143260000900212300001200221490000700233520054100240653002100781653004400802653002600846653003800872100001300910700001200923856011700935 2014 eng d00aThe performance evaluation of university scientific research project management based on the FAHP0 aperformance evaluation of university scientific research project c2014 a18 - 250 v123 aAlong with the advance of scientific powers strategic of our country, all types and levels funding limit and quantity of college scientific research project have also increased constantly. It is very important to have complete, accurate and fair evaluations for university scientific research project management performance. Fuzzy analytic hierarchy process (FAHP) as a qualitative, a quantitative and comprehensive evaluation method can be able to evaluate the university scientific research project management performance effectively.10aCollege research10aFuzzy analytic hierarchy process (FAHP)10aFuzzy judgment matrix10aManagement performance evaluation1 aWang, B.1 aLiu, D. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84900456922&partnerID=40&md5=ce39e1cb0f995af4ded628027c5968ea01557nas a2200193 4500008004100000245013800041210006900179260000900248300001400257490000700271520080600278653002201084653004101106653004701147653002501194100001301219700001401232856011701246 2013 eng d00aParameters selection in the discrete particle swarm optimization algorithm solving gate and runway combinational optimization problem0 aParameters selection in the discrete particle swarm optimization c2013 a197 - 2010 v113 aGate and runway combinational optimization (GRCO) problem is of great significance in airport operation. In this paper, experimental analysis is performed on the parameters characteristics of the discrete particle swarm optimization (DPSO) algorithm for combinatorial optimization problems. Inertia weight, acceleration constants and population size all have an important impact on the performance of the algorithm. Optimal values exist in the specific application of the respective parameters. The optimal value interval of the population size does not vary with different acceleration constants when inertia weight is constant. Increasing the population size can improve the solution quality, but the time overhead increases significantly. Finally, each parameters selection guidelines are provided.10aAirport operation10aDiscrete particle swarm optimization10aGate and runway combinational optimization10aParameters selection1 aDing, J.1 aZhang, Y. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84880782704&partnerID=40&md5=b89c7c4e42430962155e9283216c7b7001871nas a2200241 4500008004100000245007500041210006900116260000900185300001400194490000700208520110400215653003601319653002201355653004301377653001101420653002001431100001401451700001101465700001101476700001301487700001201500856011701512 2013 eng d00aProduction line production planning model of iron and steel enterprise0 aProduction line production planning model of iron and steel ente c2013 a131 - 1350 v113 aAt present, iron and steel enterprise develops towards the direction with many procedure, many process, many variety and many specification, and reaches hundreds and thousands of product series and product mix, how to plan, organize and control steel production, production schedule of its product line are key issues. According to the main characteristics of production line of iron and steel enterprise, how to make aggregate production planning of iron and steel enterprise are analyzed. An aggregate production plan model of product line of iron and steel enterprise is proposed, which is calculated by using standard library function of the Matlab7.0 genetic algorithm toolbox to program. Penalty function was adopted in the course of getting solution. These parameters of scale of father population, crossover probability, mutation probability and penalty factor were combined and optimized. The result obtained is in accordance with the actual conditions of this enterprise basically that the optimization solution to production plans of real iron and steel enterprise by using the algorithm.10aAggregate production plan model10aGenetic Algorithm10aIndex terms -iron and steel enterprise10aMATLAB10aProduction line1 aJiang, G.1 aHe, E.1 aLi, G.1 aKong, J.1 aXie, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84879110969&partnerID=40&md5=f4274b55fafe675f163de08cb3f49a8701506nas a2200217 4500008004100000245005000041210004800091260000900139300001200148490000700160520086000167653002201027653002001049653002101069653001701090100001401107700001701121700001601138700001701154856011701171 2012 eng d00aA Personalization layer for mediation systems0 aPersonalization layer for mediation systems c2012 a29 - 380 v103 aMediation systems allow integration of disparate and heterogeneous data sources. Unfortunately, with the increasing number of integrated sources, especially in the context of web, mediator's responses time increases considerably while the answers are not adapted to users profiles. In this paper, we present a personalization layer that makes the mediation system more sensitive to user's preferences. The layer sits between the user and the mediation system. It captures the user profile and performs a smart source selection according to user's interests and quality preferences. Selection is based on similarity measurement between users and sources models. Our solution for personalizing data source selection provides the mediator with a set of relevant data sources. These are then involved in the rewriting process to give more satisfying response.10aMediation systems10aPersonalization10aSource selection10aUser profile1 aZaoui, I.1 aWadjinny, F.1 aChiadmi, D.1 aBenhlima, L. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84857594503&partnerID=40&md5=345cb9fd1cebc3bd1598d806adb3d01201698nas a2200205 4500008004100000245009500041210006900136260000900205300001200214490000700226520100700233653003201240653002101272653001401293653002001307100001701327700001401344700001701358856011701375 2012 eng d00aPlaying games with information: Investigating perceptions of a mobile content sharing game0 aPlaying games with information Investigating perceptions of a mo c2012 a10 - 190 v103 aWe introduce Indagator (Latin for explorer), an application which incorporates multiplayer, pervasive gaming elements into mobile content sharing. Indagator allows users to annotate real world locations with multimedia content, and concurrently, provides opportunities for play through engaging interactive game elements. A study of Indagator was conducted to obtain usability feedback, and to examine the impact of the usability of its content sharing and gaming features on participants' intention to use it. Participants used the software to complete a set of tasks and subsequently completed a questionnaire and attended an interview, both of which were to elicit their opinions on the usability of the system. Participants felt that the features in Indagator were able to support the objectives of content sharing and gaming, and that idea of gaming could be a motivator for content sharing. In terms of intention to use, usability of Indagator's gaming features emerged as significant predictors.10aMobile Content Sharing Game10aSocial Computing10aUsability10aUser Evaluation1 aGoh, D.H.-L.1 aLee, C.S.1 aChua, A.Y.K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84863281265&partnerID=40&md5=41c91a3b7957ec0b637c641bf9ba9a6e01438nas a2200229 4500008004100000245007900041210006900120260000900189300001200198490000600210520070900216653001400925653001900939653002300958653003400981100001701015700001601032700001401048700001301062700001601075856011701091 2011 eng d00aPassword based anonymous authentication with private information retrieval0 aPassword based anonymous authentication with private information c2011 a72 - 780 v93 aThis paper focuses on authentication with three types of entities: a user who sends an authentication request, a service provider who receives and verifies the request, and a database who supplies the service provider with information for verifying the request. This paper presents novel authentication protocols that satisfy the following important properties: (1) secure against replay attacks and (2) the database cannot identify which user is authenticating. First, we show a protocol which satisfies Properties (2). Second, we show a protocol which satisfies Properties (1) and (2). A key idea of our authentication protocols is to use private information retrieval (PIR) [Chor et al. J. ACM, 1998].10aAnonymity10aAuthentication10aPrivacy protection10aPrivate information retrieval1 aNakamura, T.1 aInenaga, S.1 aIkeda, D.1 aBaba, K.1 aYasuura, H. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960675855&partnerID=40&md5=0726c99925b632851b1817cb7859e93101659nas a2200169 4500008004100000245009300041210006900134260000900203300001400212490000600226520105300232653002401285653002501309653002301334100001501357856011701372 2011 eng d00aThe performance analysis of a service deployment system based on the centralized storage0 aperformance analysis of a service deployment system based on the c2011 a287 - 2910 v93 aBecause of its data centralized management characteristic, which conveniently realize resources sharing and the data fast clone, the service deployment technology based on the centralized storage can achieve fast deployment for the system service through the network boot methed or the method of downloading disk image from the remote storage server. However, for the data centralism the I/O load is also congested on the storage server, which creates the drop of the overall system performance and the reducing of the service quality. So we need to test and analyze its performance factors, which provide the clue for the solution of the performance bottleneck. In this paper, we use the SonD deployment system, which is based on the centralized storage, as the analysis prototype to carry on the analysis to the client boot process, evaluate its performance influence factors such as the memory size of storage server, data distribution on the storage server through the real or simulated method, and give suggestion of the performance optimized.10aCentralized Storage10aPerformance Analysis10aService Deployment1 aDong, Z.X. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-84855403722&partnerID=40&md5=ef5c7bf82725ab97629cbfa9acd24bfb01462nas a2200193 4500008004100000245006200041210005900103260000900162300001200171490000600183520083600189653002001025653003301045653002501078653002601103100001101129700001101140856011701151 2011 eng d00aA practical and secure buyer-seller watermarking protocol0 apractical and secure buyerseller watermarking protocol c2011 a43 - 470 v93 aDigital watermarking is an emerging technology for combating copyright piracy. In real applications, the transaction between a buyer and a seller is done through a specific watermarking protocol, which enables the seller to successfully identify a traitor from a pirated copy, while preventing the dishonest seller from framing an inno cent buyer. In this paper, we propose a new buyer-seller watermarking protocol. Compared to the previous works, it makes two improvements, which make it more practi cal. First, no third party is introduced and hence, the problem of the seller (or buyer) colludes with a third party to cheat the buyer (or seller) is solved. Second,a double watermark insertion is avoided, and then the final quality of the watermarked content is higher and the result of the watermark detection is more accurate.10aCopy deterrence10aDigital copyright protection10aDigital watermarking10aWatermarking protocol1 aHu, D.1 aLi, Q. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960684787&partnerID=40&md5=2a64f864f0b47aac9775c3f7d261c7e001376nas a2200217 4500008004100000245005900041210005600100260000900156300001200165490000600177520074200183653001500925653001700940653000800957653001300965653001500978100001700993700001601010700001501026856011701041 2011 eng d00aA practical U-healthcare network with security and QoS0 apractical Uhealthcare network with security and QoS c2011 a87 - 940 v93 aAs a consequence of rapid technological development, the normally isolated medical sensor platform is gradually being integrated into networks. However, most ubiquitous or mobile health systems are lacking a system that combines both network security and QoS (Quality of Service). This paper investigates the possible security and QoS methods of a ubiquitous healthcare network platform in OSI (Open System Interconnections)-layers. This network platform is based on the Wireless Overlay Networks (WON) Bluetooth, 802.11 and 802.16 over IPv6 network, and provides a secure and stable U-healthcare platform by including the application of healthcare sensors with RFID, U-healthcare PDA, VoIPv6, falling detection, and patient orientation.10aHealthcare10aIPv6 network10aQoS10aSecurity10aUbiquitous1 aHuang, S.-Y.1 aHung, C.-C.1 aLee, C.-C. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960689974&partnerID=40&md5=ac1cfe986d44de663237d411cebdc5cc01906nas a2200217 4500008004100000245006900041210006900110260000900179300001400188490000600202520124400208653001801452653001601470653001501486653001001501100001501511700001301526700001601539700001601555856011701571 2010 eng d00aPerformance evaluation of fixed and mobile relay in WiMAX system0 aPerformance evaluation of fixed and mobile relay in WiMAX system c2010 a190 - 1950 v83 aFuture wireless communication systems are expected to provide more stable and higher data rate transmissions in the whole network. WiMAX is one of the technologies to cover diverse geographic regions. WiMAX covers the high dense urban areas and provide access over large geographic regions in remote rural area. However, in both scenarios it is challenging to cover the entire service area. In both cases relays are foreseen to extend the range of the BS and to increase the system throughput allowing for a cost-efficient deployment and service. As multi-hop/relay has complex interactions between the routing and medium access control decisions, the extent to which analytical expressions can be used to explore its benefits are limited. Consequently simulations tend to be the preferred way of assessing the performance of relays. In this paper, we explain, how to deploy fixed-relay and mobile relay by using computer simulation in WiMAX system and we consistently observed that the throughput is increased and the outage is decreased in the relay-augmented WiMAX network, which is converted to range extension without any capacity penalty, for the realistic range of values of the propagation and other system parameters investigated.10aCoverage area10aFixed relay10aThroughput10aWiMAX1 aMumtaz, S.1 aTu, L.T.1 aSadeghi, R.1 aGameiro, A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-79960663765&partnerID=40&md5=08f3181dd0a1828512060fb801f8eadc01900nas a2200229 4500008004100000245011200041210006900153260000900222300001400231490000600245520109000251653001701341653002201358653003401380653002401414653003001438653002801468100002301496700001801519700001601537856011701553 2008 eng d00aPersonalized document ranking: Exploiting evidence from multiple user interests for profiling and retrieval0 aPersonalized document ranking Exploiting evidence from multiple  c2008 a354 - 3650 v63 aThe goal of personalization in information retrieval is to tailor the search engine results to the specific goals, preferences and general interests of the users. We propose a novel model for both user profiling and document ranking that consider the user interests as sources of evidence in order to tune the accuracy of the documents returned in response to the user query. User profiling is performed by managing the user search history using statistical based operators in order to highlight the user short-term interests seen as surrogates for building the long-term ones. The document ranking model's foundation comes from influence diagrams which are extension of Bayesian graphs, dedicated to decision-making problems. Hence, query evaluation is carried out as an inference process that aims at computing an aggregated utility of a document by considering its relevance to the query but also the corresponding utility with regard to the user's topics of interest. Experimental results using enhanced TREC collections indicate that our personalized retrieval model is effective.10aData Quality10aGrammar Formalism10aIntegrity Constraint Checking10aSpatial Consistency10aTopological Relationships10aVisual Language Parsing1 aTamine-Lechani, L.1 aBoughanem, M.1 aZemirli, N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-70349921290&partnerID=40&md5=8adac2115f775267c564b7fcb8a379f101303nas a2200181 4500008004100000245005300041210005200094260000900146300001100155490000600166520074400172653001400916653002300930100001700953700001700970700001700987856011701004 2007 eng d00aPalette-based image segmentation using HSL space0 aPalettebased image segmentation using HSL space c2007 a8 - 110 v53 aThis paper describes a palette-based colored image segmentation system. In this paper we analyzed the properties of Hue, Saturation, and Luminance (HSL) color space with emphasis on the visual perception of the variation in Hue, Saturation and Luminance values of palette colors. The proposed algorithm based on the concept of re-coloring the palette colors of 256-color images using the properties of HSL color space and segmenting true type images by taking part of the image, generating a palette to it then apply the method to segment the selected region. After re-coloring of the palette colors the colors in the image will be re-colored according to its new palette, and as a result the image will be segmented to different segments.10aHSL space10aImage segmentation1 aKrikor, L.Z.1 aBaba, S.E.I.1 aKrikor, M.Z. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33947359481&partnerID=40&md5=5f2dbcc5beba47749ba2c598939ab1d401559nas a2200229 4500008004100000245008500041210006900126260000900195300001400204490000600218520086100224653001901085653001201104653001601116653000901132653001501141653001301156653001001169100001701179700001601196856011701212 2007 eng d00aPerformance of integrated wired (Token ring) network and wireless (PRMA) network0 aPerformance of integrated wired Token ring network and wireless  c2007 a372 - 3770 v53 aComputer networks can be built using either wired or wireless technology. Although wired network has been the traditional choice, wireless technologies are becoming more popular. One of the most challenges is to have an existing wired network to which a wireless network extension could be added. Specifically the challenge is to connect a group of wireless networks through a wired backbone. The primary purpose of this study is to develop an integrated mathematical model by integrating Packet Reservation Multiple Access (PRMA) one of the most wireless LAN protocols and Token Ring wired network protocol. Performance parameters of an integrated PRMA-Token Ring model such as delay and throughput have be analyzed. The numerical analysis presented in this paper may help in studying the affect of some parameters on the system performance and stability.10aHybrid network10aNetwork10aPerformance10aPRMA10aToken ring10aWireless10aWords1 aAl-Amawi, A.1 aKhanfar, K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-49149110443&partnerID=40&md5=461f26224ae3a230d93b0fcefcafdf1d01994nas a2200181 4500008004100000245006700041210006600108260000900174300001400183490000600197520137800203653002101581653004601602653001801648653001201666100001701678856011701695 2007 eng d00aPersonalized searching by learning wordnet-based user profiles0 aPersonalized searching by learning wordnetbased user profiles c2007 a309 - 3220 v53 aThe amount of information available on the Web and in Digital Libraries is increasing over time. In this context, the role of user modeling and personalized information access is becoming crucial: Users need a personalized support in sifting through large amounts of retrieved information according to their interests. Information filtering and retrieval systems relying on this idea adapt their behavior to individual users by learning their preferences during the interaction in order to construct a profile of the user that can be later exploited in the search process. We propose a novel technique to learn user profiles which exploits word sense disambiguation based on the WordNet lexical database, in an attempt to produce semantic user profiles that might discover topics semantically closer to the user interests. Semantic profiles are used in the definition of a retrieval model that turns the traditional document-query search paradigm into a novel document-query-profile paradigm. As an example of this paradigm, we present an extension of the vector space model in which profiles are used to modify the ranking of search results obtained in response to a query, hopefully putting personally relevant items on the top of the result list. Experimental results in a movie retrieval scenario indicate that the proposed model to personalize Web search is effective.10aMachine learning10aPersonalization and information filtering10aUser modeling10aWordNet1 aSemeraro, G. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-66149191527&partnerID=40&md5=750d800edd5f7fe76d849dd465dafff901809nas a2200217 4500008004100000245008200041210006900123260000900192300001400201490000600215520109000221653002601311653003401337653002001371653001501391100001501406700001401421700001501435700002401450856011701474 2007 eng d00aPre-processing and Path Normalization of a web graph used as a social network0 aPreprocessing and Path Normalization of a web graph used as a so c2007 a262 - 2760 v53 aMany efforts have been made for compression of web graphs. Most of these methods are suitable for search engines and are centered around encoding links and URLs efficiently. The purpose is to handle a large set of web pages in the main memory against any web based search. The authors of the present paper are interested in studying web graph as a social network and to develop a data model for it. So, suitable compression techniques, which are space efficient for disk based storage, are required. This paper has provided a two level compression technique. In the first level, the structural properties of a graph are studied and strongly connected components are fused to reduce the original graph to a DAG. Paths on this DAG are then stored efficiently using a Path Normalization technique. Space complexity expressions indicate the efficiency of the method. Relevant operators required for accessing the original graph through the compressed representations have also been discussed. Important earlier works have been referred to indicate the requirements of the present approach.10aCompression technique10aPath normailisation technique10aSocial software10aWeb search1 aTeja, C.B.1 aMitra, S.1 aBagchi, A.1 aBandyopadhyay, A.K. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-57949092373&partnerID=40&md5=08a3428b63ad14c630820944a0e9c22201398nas a2200193 4500008004100000245006700041210006700108260000900175300001400184490000600198520077200204653002500976653002001001653002001021653001501041100001501056700001601071856011701087 2007 eng d00aPromotion of local to global operation in train control system0 aPromotion of local to global operation in train control system c2007 a231 - 2360 v53 aRailway interlocking system is a safety critical system. Its failure can cause the loss of human life, severe injuries and loss of money. Therefore the complication of this type of system requires advanced methodologies, which provide complete security and quality of a system. One way of achieving this goal is by using formal methods, which are mathematically based languages, techniques and tools used for specifying and verifying such systems. This paper provides the control of trains in a sector of moving block interlocking system using the approach of promotion. The promotion is the approach used to link the local state with a global state in Z specifications. The control comprises three components, i.e. sector, trains and security of a train in a sector.10aFormal specification10aPredicate logic10aSchema calculus10aZ notation1 aKhan, S.A.1 aZafar, N.A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44949158690&partnerID=40&md5=9dfd5e28516c12ab2f9a5cfc8da8d3f901562nas a2200181 4500008004100000245008900041210006900130260000900199300001400208490000600222520092100228653002401149653002701173653002301200653002601223100001401249856011701263 2006 eng d00aParallel algorithms for the generalized same generation query in deductive databases0 aParallel algorithms for the generalized same generation query in c2006 a192 - 1960 v43 aThe intelligence of traditional database systems can be improved by recursion. Using recursion, relational database systems are extended into knowledge-base systems (deductive database systems). Linear recursion is the most frequently found type of recursion in deductive databases. Deductive databases queries are computationally intensive and lend themselves naturally to parallelization to speed up the solution of such queries. In this paper, parallel algorithms to solve the generalized fully and partially instantiated forms of the same generation query in deductive databases are presented. The algorithms use special data structures, namely, a special matrix that stores paths from source nodes of the graph representing a two-attribute normalized database relation to all nodes reachable from these source nodes, and a reverse matrix that stores paths from any node to all source nodes related to that node.10aDeductive databases10aLinear recursive rules10aParallel databases10aSame generation query1 aArman, N. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33749424147&partnerID=40&md5=f02aca3cb9370bdc7720ce48f750727801975nas a2200205 4500008004100000245009500041210006900136260000900205300001400214490000600228520128200234653002801516653001001544653002701554653001701581100001701598700001501615700002201630856011701652 2006 eng d00aPeer-to-peer content search supported by a distributed index in a publication/search model0 aPeertopeer content search supported by a distributed index in a  c2006 a175 - 1830 v43 aPeer to-peer networks (P2P) are considered a valid approach for the construction of distributed systems. Further research projects in the last few years have focused on using this kind of networks as an alternative for solving different situations that have traditionally required centralized servers, such as search engines. This paper deals with the problem of content search in highly distributed and dynamic environments. We propose and evaluate a distributed index model built upon a peer-to-peer network which supports complete indexing of text documents and allows searching by content. A distinctive feature of this proposal is that it requires no specific network topology or hierarchy. Evaluations with different settings were performed by simulating a 10,000-node network, where each node had the capability to share documents. With regard to the traffic generated, experiments show an improvement in efficiency of between 84% and 93% over similar systems like Gnutella. The evaluation of retrieval performance using a test collection showed that the P2P system was able to achieve the same level of performance as the centralized system. It was also found that the amount of traffic generated by this model varies between 80 and 225 Kb per set of query and answers.10aDistributed index model10aNodes10aP2P network evaluation10aP2P networks1 aTolosa, G.H.1 aPeri, J.A.1 aBordignon, F.R.A. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33749394455&partnerID=40&md5=1ab83251bfe0f9c3bd58f562a631233601764nas a2200217 4500008004100000245007900041210006900120260000900189300001400198490000600212520102200218653002601240653002501266653004101291653003001332100001401362700002301376700001501399700001501414856011701429 2006 eng d00aProviding support for interaction with consistent multimedia presentations0 aProviding support for interaction with consistent multimedia pre c2006 a124 - 1300 v43 aMultimedia presentations are generally specified in terms of spatial and temporal relations between the media objects involved. Creation of these presentations, and interactions with them during their play-out, require an effective mechanism for handling the specifications dynamically. These specifications could result in inconsistencies, which need to be checked and resolved. Moreover, consistent presentations could become inconsistent due to interactions during the playout. Our main contribution is the design of an algorithm which aids in resolving these consistency issues dynamically and efficiently. The other salient features of our approach are a new composite spatio-temporal operator and an effective relaxation policy. We have developed a prototype which helps to study the effectiveness of the proposed approach. Thus, this paper presents an interactive multimedia presentation mechanism, which maintains a consistent and complete set of constraints during authoring and play-out of the presentation.10aCompleteness checking10aConsistency checking10aDistributed multimedia presentations10aSpatio-temporal relations1 aElias, S.1 aEaswarakumar, K.S.1 aMathew, L.1 aChbeir, R. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-44649102725&partnerID=40&md5=6d8bb6f8d9dff4f2b87372209551154a01850nas a2200193 4500008004100000245007600041210006900117260000900186300001400195490000600209520120400215653002101419653003101440653001901471653001601490653001701506100001601523856011701539 2006 eng d00aPruning techniques in associative classification: Survey and comparison0 aPruning techniques in associative classification Survey and comp c2006 a197 - 2020 v43 aAssociation rule discovery and classification are common data mining tasks. Integrating association rule and classification also known as associative classification is a promising approach that derives classifiers highly competitive with regards to accuracy to that of traditional classification approaches such as rule induction and decision trees. However, the size of the classifiers generated by associative classification is often large and therefore pruning becomes an essential task. In this paper, we survey different rule pruning methods used by current associative classification techniques. Further, we compare the effect of three pruning methods (database coverage, pessimistic error estimation, lazy pruning) on the accuracy rate and the number of rules derived from different classification data sets. Results obtained from experimenting on different data sets from UCI data collection indicate that lazy pruning algorithms may produce slightly higher predictive classifiers than those which utilise database coverage and pessimistic error pruning methods. However, the potential use of such classifiers is limited because they are difficult to understand and maintain by the end-user.10aAssociation rule10aAssociative classification10aClassification10aData mining10aRule pruning1 aThabtah, F. uhttp://www.scopus.com/inward/record.url?eid=2-s2.0-33749400880&partnerID=40&md5=0633368b3744eefc60e6e205c64d95f4