CN102957948B - A kind of processing method of the broadcast content timeline data for television program assessment - Google Patents
A kind of processing method of the broadcast content timeline data for television program assessment Download PDFInfo
- Publication number
- CN102957948B CN102957948B CN201110253503.6A CN201110253503A CN102957948B CN 102957948 B CN102957948 B CN 102957948B CN 201110253503 A CN201110253503 A CN 201110253503A CN 102957948 B CN102957948 B CN 102957948B
- Authority
- CN
- China
- Prior art keywords
- record
- new
- carry out
- out step
- last item
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Abstract
The present invention relates to a kind of processing method of the broadcast content timeline data for television program assessment, this processing method comprises the following steps: 1) data processing server loads the program log file in program log document storage server, generate new program data, after having loaded, carry out step 2); 2) the ad log file in data processing server carrying advertisement journal file storage server, generates new advertising listing data, carry out step 3 after having loaded); 3) new timeline object set is set up, merged in timeline object set according to time order and function and priority by ad data in program data in new the rendition list and new advertising listing, then holding time line object set is to database server.Compared with prior art, the present invention can fast and accurately by two independently timeline daily record merge into complete, precise restoration plays a situation timeline, successfully solve the problem of this field timeline data processing.
Description
Technical field
The present invention relates to a kind of processing method of data, especially relate to a kind of processing method of the broadcast content timeline data for television program assessment.
Background technology
Set up the television program assessment system of science, actual for TV station broadcast content and situation must be carried out filing and arrange, become the data format that investigation and analysis are available, this is the element task analyzed the viewership of TV programme, assess.Along with the wave of digitalization in whole media industry, it is more and more accurate that the volume of TV station to program and advertisement broadcasts Row control, the behavior of televiewer's convert media and channel is more and more frequent, collects and arranges, propose in the more accurate demand of timeline this basic data of media analysis.
The archiving method that current domestic industry is taked is the method that programme content is separated with ad content, the program of normal record and broadcast and the commercial content intercutted is separated, and Document Solution is in different database files respectively.Describe the database file that program and advertisement are broadcasted, adopt approximate method to carry out the time to two kinds of different broadcast contents, the filing in channel and content.The critical field describing its record is mainly, and broadcasts channel, broadcasts the date, broadcast items/advertised name, broadcasts initial time, the close of transmission time etc.Such archiving method, does not reduce the intact condition of television broadcasting, and the value that the data obtained are analyzed further is restricted, and can only analyze the broadcast of program or advertisement itself from respective angles.
In order to solve the problem, mainly use in the industry excel macro to process broadcasting daily record data, and independently playing daily record by VBA program integration two.Due to the limitation of Excel self, when process large-scale data, the speed of service is relatively slow, and the timeline data after preserving merging cannot be concentrated for analysis and research.The computer of a mainstream configuration, the cost time of 5 minutes is needed when merging the broadcast daily record of 15 days of 1 channel (about 12000 recording) in Excel, and the time of several days will be spent to carry out the previous works such as program arrangement, complete the daily record of 15 days of 62 channels and merge the time needing to spend 3 months nearly, cannot analyze timely broadcast situation.
Summary of the invention
Object of the present invention be exactly provide to overcome defect that above-mentioned prior art exists a kind of by two independently timeline daily record merge into complete, accurate reproduction plays a situation timeline, successfully solve the processing method of the broadcast content timeline data for television program assessment of this field timeline data processing problem.
Object of the present invention can be achieved through the following technical solutions: a kind of processing method of the broadcast content timeline data for television program assessment, it is characterized in that, this processing method comprises the following steps: 1) data processing server loads the program log file in program log document storage server, generate new program data, after having loaded, carry out step 2); 2) the ad log file in data processing server carrying advertisement journal file storage server, generates new advertising listing data, carry out step 3 after having loaded); 3) new timeline object set is set up, merged in timeline object set according to time order and function and priority by ad data in program data in new the rendition list and new advertising listing, then holding time line object set is to database server.
Described step 1) specifically comprise the following steps: the program recording 11) read in program log file is capable, and determines whether end-of-file, then terminates if the judgment is Yes, otherwise carry out step 12); 12) program A is regenerated in a new format by capable for program recording, whether the title then judging program A is " program starts " or " program terminates ", if the judgment is Yes, then carry out step 13), otherwise judge whether the time started of program A equals the end time of the program B that regenerates, if the judgment is Yes, then program A is added new the rendition list, otherwise carry out step 14); 13) priority of program A is set to very, if the name of program A is called " program starts ", program A is added new the rendition list, then carry out step 11), if the name of program A is called " program terminates ", then program A is added new the rendition list, terminate; 14) judge whether the time started of program A is greater than the end time of program B, if the judgment is Yes, then regenerate new program C, and joined new the rendition list, carry out step 11), otherwise carry out step 15); 15) program journal file misregistration is described, forwards to and manually process, and terminate.
Described step 2) specifically comprise the following steps: the advertising record row 21) reading ad log file, and determine whether end-of-file, then terminate if the judgment is Yes, otherwise carry out step 22); 22) advertising record row is regenerated advertisement A in a new format, then judge whether the time started of advertisement A is more than or equal to the end time of the advertisement B that regenerates, if the judgment is Yes, then advertisement A is added new advertising listing, carry out step 21), otherwise carry out step 23); 23) ad log file record mistake is described, forwards to and manually process, and terminate.
Described step 3) specifically comprise the following steps: 31) set up new timeline object set, judge whether to process all program datas in new the rendition list and all ad datas in new advertising listing, then carry out step 32 if the judgment is Yes), otherwise carry out step 34); 32) detect in new timeline object set whether there is new channel, then preserve new channel if the judgment is Yes to database, carry out step 33), otherwise directly carry out step 33); 33) judge whether there is new program in new timeline object set, then preserve new timeline object set if the judgment is Yes to database, terminate; 34) judge that whether new the rendition list and new advertising listing are all not for empty, if the judgment is Yes, then carry out steps 35), otherwise carry out step 38); 35) judge whether the initial time of the program data in new the rendition list is less than the initial time of the ad data in new advertising listing, if the judgment is Yes, then carry out step 36), otherwise carry out step 37); 36) enter sub-process, select the program data in new the rendition list to compare with the last item record of time shaft in chronological order, and add new timeline object set according to rule, after having sorted, carry out step 31); 37) enter sub-process, select the ad data in new advertising listing to compare with the last item record of time shaft in chronological order, and add new timeline object set according to rule, after having sorted, carry out step 31); 38) if new the rendition list is not empty, then carry out step 36); 39) if new advertising listing is not empty, then carry out step 37).
Described step 36) or step 37) in sub-process include following steps: 501) create new timeline record R according to new the rendition list or new advertising listing; 502) judge whether new timeline object set is empty, and if the judgment is Yes, then in new timeline object set, add new timeline record R, sub-process terminates, otherwise carry out step 503); 503) judge that whether the program category of the last item record is identical with new timeline record R, if the judgment is Yes, then in new timeline object set, add new timeline record R, otherwise carry out step 504); 504) judge that whether the initial time of the last item record L is identical with the initial time of new timeline record R, if the judgment is Yes, then carry out step 505), otherwise carry out step 501); 505) judge that whether the end time of the last item record L is identical with the end time of new timeline record R, if the judgment is Yes, then carry out step 506), otherwise carry out step 507); 506) judge that whether the last item record L is preferential, if the judgment is Yes, then sub-process terminates, otherwise deletes the last item record L from new timeline object set, and adds new timeline record R in new timeline object set, and sub-process terminates; 507) judge whether the end time of the last item record L is less than the end time of new timeline record R, if the judgment is Yes, then carry out step 508), otherwise carry out step 509); 508) put as node with the end time of the last item record L, new timeline record R is split as leading portion and back segment, then judge that whether the last item record L is preferential, if the judgment is Yes, in then new timeline object set, order adds the back segment of new timeline record R, and sub-process terminates, otherwise deletes the last item record L from new timeline object set, and new timeline record R is added in new timeline object set, sub-process terminates; 509) put as node with the end time of new timeline record R, the last item record L is split as leading portion and back segment, then judge that whether the last item record L is preferential, if YES, then sub-process terminates, otherwise carry out step 510); 510) from new timeline object set, delete the last item record L, and order adds the back segment of new timeline record R and the last item record L in new timeline object set, sub-process terminates; 511) judge whether the initial time of the last item record L is less than the initial time of new timeline record R identical, if the judgment is Yes, then carry out step 512), otherwise carry out step 525); 512) judge whether the end time of the last item record L is less than the end time of new timeline record R, if the judgment is Yes, then carry out step 513), otherwise carry out step 514); 513) in the end generate new record " technological debugging " between end time of a record L and the initial time of new timeline record R, and add new record " technological debugging " in new timeline object set, sub-process terminates; 514) judge whether the last item record L is program and preferentially, then carry out step 515 if the judgment is Yes), otherwise carry out step 521); 515) judge whether the end time of the last item record L is greater than the initial time of new timeline record R and is less than end time of new timeline record R simultaneously, then carry out step 516 if the judgment is Yes), otherwise carry out step 517); 516) with the initial time of new timeline record R for node, the last item record L is split as leading portion and back segment, then with the end time of the last item record L for node, new for fractionation timeline record R is split as leading portion and back segment, the last item record L is deleted from new timeline object set, and order adds the leading portion of the last item record L, the leading portion of new timeline record R, the back segment of new timeline record R in new timeline object set, sub-process terminates; 517) judge whether the end time of the last item record L is greater than the end time of new timeline record R, if the judgment is Yes, then carry out step 518), otherwise carry out step 519); 518) with the initial time of new timeline record R and end time for node, fractionation the last item record L is split as leading portion, stage casing, back segment, the last item record L is deleted from new timeline object set, and order adds the back segment of the leading portion of the last item record L, new timeline record R, the last item record L, sub-process terminates; 519) judge whether the end time of the last item record L equals the end time of new timeline record R, if the judgment is Yes, then carry out step 520), otherwise new timeline record R is added in new timeline object set, sub-process terminates; 520) with the initial time of new timeline record R for node, fractionation the last item record L is split as leading portion and back segment, then from new timeline object set, delete the last item record L, and order adds the leading portion of the last item record L and new timeline record R, sub-process terminates; 521) if the last item record L is not new record " technological debugging " and the last item record L is not advertisement, then carry out step 522), otherwise directly in new timeline object set, add new timeline record R; If the last item record L is not new record " technological debugging " and the last item record L is preferential, then carry out step 522), otherwise directly in new timeline object set, add new timeline record R; 522) judge whether the end time of the last item record L is greater than the initial time of new timeline record R and the end time of the last item record L is less than end time of new timeline record R, if the judgment is Yes, then carry out step 523), otherwise carry out step 524); 523) with the initial time of new timeline record R for node, the last item record L is split leading portion and back segment, with the end time of the last item record L for node, new timeline record R is split as leading portion and back segment, then from new timeline object set, the last item record L is deleted, and order adds the back segment of the leading portion of the last item record L, the back segment of the last item record L and new timeline record R, sub-process terminates; 524) judge whether the end time of the last item record L is more than or equal to the end time of new timeline record R, and if the judgment is Yes, then sub-process terminates, otherwise directly in new timeline object set, add new timeline record R; 525) judge whether the end time of the last item record L is greater than the end time of new timeline record R, if the judgment is Yes, then carry out step 526), otherwise carry out step 527); 526) with the end time of new timeline record R for node, the last item record L is split leading portion and back segment, then from new timeline object set, delete the last item record L, and order adds the back segment of new timeline record R and the last item record L, sub-process terminates; 527) judge whether the end time of the last item record L is less than the end time of new timeline record R, if the judgment is Yes, then carry out step 528), otherwise carry out step 529); 528) with the end time of the last item record L for node, new timeline record R is split as leading portion and back segment, then from new timeline object set, delete the last item record L, and order adds the leading portion of new timeline record R and the back segment of new timeline record R; 529) from new timeline object set, delete the last item record L, then add new timeline record R, sub-process terminates.
Compared with prior art, the present invention automatically scans program and channel and processes, fast and accurately two are independently play daily record and merge into complete, precise restoration plays a situation timeline, the time merging the broadcast daily record of 15 days of 1 channel foreshortened to 30 seconds (not calculating the write into Databasce time) by original 5 minutes, the Primary Stage Data handling implements such as program arrangement also complete automatically, and the time foreshortened to clock more than 5 points by original several days.Add the database write angle of incidence, the broadcast daily record of 15 days of 62 channels can complete in 15 hours, considerably increased the ageing of research, and data centralization is preserved in a database, convenient analysis further and research.
The present invention is by the research and analysis to two parts data, according to the practical ways of television program transmission and advertisement insertion, devise by with the data method of timeline for crucial clue, in the mode of computer program, the general programs of apportion is broadcasted daily record data and advertisement and broadcast daily record two parts journal file and achieve first and unite two into one.Database log file after merging, the detailed situation information of common record and broadcast program and advertisement insertion is integrated in the same records series of timeline continuous print, accurately and objectively reduce the actual broadcast situation of TV station, can intactly all actual contents of watching after turning on TV of reproduced television spectators, for analyzing and study the various situations occurred in the communication effect of TV media and communication process further, provide portion more favorably basic data, and opened to professional researcher the research angle and possibility that apportion document originally cannot provide, can understand intuitively and intercut what kind of advertisement between what program, the position of each advertisement insertion is again how to be distributed in whole television broadcasting process.This, to the relevant practitioner of inspiration and researcher, serves new promotion and help.
Accompanying drawing explanation
Fig. 1 is the flow chart of the inventive method;
Fig. 2 is the sub-process figure of the inventive method;
Fig. 3 is the system configuration schematic diagram of the inventive method.
PL in Fig. 1: program set, AL: advertising aggregator, TL: timeline set, SoT: transmission opening flag, EoT: end of transmission mark, SDT: program starting date time, EDT: time program Close Date;
PL in Fig. 2: program set, AL: advertising aggregator, TL: timeline set, SoT: transmission opening flag, EoT: end of transmission mark, SDT: program starting date time, EDT: time program Close Date.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention is described in detail.
Embodiment
As shown in Figure 1, the present embodiment comprises the following steps:
1) data processing server loads the program log file in program log document storage server, generates new the rendition list PL.Program log file is the broadcast daily record in a certain channel a period of time.Form is Excel file, and worksheet names is " program ", the order of row is { " programm name ", " channel ", " date ", " time started ", " end time ", " audience ratings ", " market share " }, the first behavior row title.Record according to date and time started ascending order arrangement.Generate the rendition list PL simultaneously.PL is an object set preserving program, and the element P in set represents a broadcast items, has the attribute { column data in the corresponding journal file of Label, Channel, Date, SDT, EDT, IsPriority} difference.Now there is no object elements in PL.Carry out step 2).
2) program recording is read capable: read a line in program log.Carry out step 3).
3) judge whether end-of-file, then carry out step 13 if the judgment is Yes), otherwise carry out step 4).
4) program is generated: according to the program log row read, generate new program P.Carry out step 5).
Does is 5) title SoT or EoT?: determine whether the mark starting to broadcast and terminate to broadcast, if the judgment is Yes, then carry out step 6), otherwise carry out step 8).
6) program priority is set to True: program priority IsPriority is set to 1, (being defaulted as 0).Carry out step 7).
7) program is added the rendition list PL, carry out step 2).
8) EDT of the upper record of SDT=is judged?: namely judge whether the time started P.SDT of actual program P equals the end time P ' .EDT of a upper program P ' in PL.Here whether continuous at detection program.Carry out step 7 if the judgment is Yes), otherwise carry out step 9).
9) EDT of the upper record of SDT > is judged?: namely judge whether the time started P.SDT of actual program P is greater than the end time P ' .EDT of a upper program P ' in PL.If condition is set up, illustrate between program discontinuous, need to generate new program to fill.Then carry out step 10 if the judgment is Yes), otherwise carry out step 9).
10) new program is generated: the EDT of the upper record of Label=" without program ", SDT=, EDT=SDT}, carry out step 11).
11) by step 10) in generate new program NP add the rendition list PL, carry out step 7).
12) original record is illegal, forwards artificial treatment to, step 8) and step 9) condition be false, illustrate the time started of this record early than upper one record end time, log have problems, need to carry out artificial treatment.Flow process terminates.
13) the ad log file in data processing server carrying advertisement journal file storage server, generates new advertising listing AL: ad log file is the broadcast daily record in a certain channel a period of time.Form is Excel file, and worksheet names is " advertisement ", the order of row is { " advertised name ", " date ", " channel ", " time started ", " duration ", " audience ratings ", " price " }, the first behavior row title.Record according to date and time started ascending order arrangement.Generating advertisement list AL simultaneously.AL is an object set preserving advertisement, and the elements A in set represents one and broadcasts advertisement, has the attribute { column data in the corresponding journal file of Label, Channel, Date, SDT, EDT} difference.Now there is no object elements in AL.Wherein EDT will calculate according to SDT and duration.Carry out step 14).
14) advertising record row is read: read a line in ad log, carry out step 15).
15) judging whether end-of-file, for being, carry out step 20), otherwise carry out step 16).
16) generating advertisement: according to the ad log row read, generate new advertisement A.Carry out step 17).
17) EDT of SDT >=upper record is judged?: namely whether the time started A.SDT of actual program A is more than or equal to the end time A ' .EDT of a upper program A ' in AL.Here in the legitimacy detecting daily record sequencing.Then carry out step 18 if the judgment is Yes), otherwise carry out step 19).
18) advertisement is added advertising listing AL, carry out step 14).
19) original record is illegal, forwards artificial treatment to: step 17) condition is false, and the end time of the time started of this record early than a upper record is described, log has problems, and needs to carry out artificial treatment.Flow process terminates.
20) newly-built timeline TL:TL is the object set of a holding time line record, and what preserve in timeline can be program, can be advertisement, also can be debug signal, there is attribute { ProgramName, Channel, Date, SDT, EDT} carry out steps 21).
21) initialization pi, ai: initialization pi, ai.Pi and ai is the call number of object elements in gathering for index PL and AL.Carry out step 22).
22) pi+ai < PL.Count+AL.Count is judged?: namely judging whether to process objects all in PL and AL, for being, carry out step 31), otherwise carry out step 23).
23) judge PL [pi] not as empty, and AL [ai] is not for empty: judge whether to there is PL [pi] or AL [ai] object.If both exist, then need the priority judging its time started SDT.For being, carry out step 24), otherwise carry out step 29).
24) PL [pi] .SDT < AL [ai] .SDT is judged?: judge that whether the initial time of program is more Zao than the initial time of advertisement, for being carry out step 25), otherwise carry out step 27).
25) enter sub-process S-PL [pi] is compared with the last item record of time shaft, and add TL according to rule, carry out step 26).
26) pi++: the call number of cumulative PL, carry out step 22).
27) enter sub-process S-AL [ai] is compared with the last item record of time shaft, and add TL according to rule, carry out step 28).
28) ai++: the call number of cumulative AL, carry out step 22).
29) do you judge that PL [pi] is not?: step 23) when being false, in PL [pi] or AL [ai], have at least one not exist.If there is no illustrate that PL has processed.Here detect PL [pi] whether to exist.If there is PL [pi], just it is processed.For being, carry out step 25), otherwise carry out step 30).
30) AL [ai] is judged not as empty?: step 23) and step 29) when being false, AL [ai] may not exist, and if there is no, illustrates that AL has processed.Here detect AL [ai] whether to exist.If exist, just it is processed.For being, carry out step 27), otherwise carry out step 22).
31) detecting in TL whether there is new channel, for being, carry out step 33), otherwise carry out step 32).
32) preserve new channel to database, carry out step 33).
33) detecting in TL whether there is new program, for being, carry out step 35), otherwise carry out step 34).
34) determine program macrotaxonomy according to program category (program/advertisement/skill is adjusted), and preserve new program, carry out step 35).
35) line is to database server the holding time, and flow process terminates.
Sub-process comprises the following steps:
S1) create new timeline record R according to PL [pi] or AL [ai], carry out step S2).
S2) judging TL whether not record, for being, carrying out step S3), otherwise carry out step S4).
S3) in TL, add R, namely directly add new timeline record R.Sub-process terminates.
S4) by the last item record assignment of TL to L.After this rule process will be carried out to L and R.Carry out step S5).
S5) is the program category of L identical with R?: whether the program category of L is identical with R.If type is identical, directly can add R, because did combing to broadcast order in PL and AL.For being carry out step S3), otherwise carry out step S6).
S6) L.SDT=R.SDT?: judge that whether initial time is identical, for being carry out step S7), otherwise carry out step S18).
S7) L.EDT=R.EDT?: judge that whether the end time is identical, for being carry out step S8), otherwise carry out step S10).
S8) do you judge that whether L preferential? for being, sub-process terminates, otherwise carries out step S9).
S9) from TL, delete L, and add R in TL, sub-process terminates.
S10) L.EDT < R.EDT is judged? for being carry out step S11), otherwise carry out step S15).
S11) splitting R in L.EDT moment point is R1, R2, carries out step S12).
S12) do you judge that whether L preferential? for being carry out step S13), otherwise carry out step S14).
S13) in TL, order adds R2:L preferentially, retains L, then adds R2, and sub-process terminates.
S14) from TL, delete L, and order adds R1, R2:L preferentially, deletes L, add R1, R2, sub-process terminates.
S15) splitting L in R.EDT moment point is L1, L2, carries out S16).
S16) do you judge that whether L preferential? for being carry out step S13), otherwise carry out step S14).
S17) L is not preferential, from TL, delete L, and order adds R, L2, and sub-process terminates.
S18) L.SDT < R.SDT is judged?: time started of L early than the time started of R, for being carry out step S19), otherwise carry out step S32).
S19) L.EDT < R.SDT is judged? for being carry out step S20), otherwise carry out step S21).
S20) new record is generated according to L.EDT and R.SDT two time points " technological debugging ", and new record is added in TL, sub-process terminates.
S21) do you judge that L is program and not preferential? for being carry out step S22), otherwise carry out step S28).
S22) L.EDT > R.SDT and L.EDT < R.EDT is judged? for being carry out step S23), otherwise carry out step S24).
S23) splitting L in R.SDT moment point is L1, L2; Splitting R at L.EDT is that R1, R2. delete L from TL, and order adds L1, R1, R2, and sub-process terminates.
S24) L.EDT > R.EDT is judged? for being carry out step S25), otherwise carry out step S26).
S25) in R.SDT and R.EDT two moment point, splitting L is that L1, L2, L3. delete L from TL, and order adds L1, R, L3, and sub-process terminates.
S26) L.EDT=R.EDT is judged? for being carry out step S27), otherwise carry out step S3).
S27) splitting L in R.SDT moment point is that L1, L2. delete L from TL, and order adds L1, R, and sub-process terminates.
S28) do you judge that L is advertisement or preferential and L is not skill adjusts? for being carry out step S29), otherwise carry out step S3).
S29) L.EDT > R.SDT is judged and L.EDT < R.EDT? for being carry out step S30), otherwise carry out step S31).
S30) splitting L in R.SDT moment point is L1, L2; Splitting R at L.EDT is that R1, R2. delete L from TL, and order adds L1, L2, R2, and sub-process terminates.
S31) L.EDT >=R.EDT is judged? for being, sub-process terminates, otherwise carries out step S3.
S32) L.EDT > R.EDT is judged? for being carry out step S33), otherwise carry out step S34).
S33) splitting L in R.EDT moment point is that L1, L2. delete L in TL, and order adds R, L2, and sub-process terminates.
S34) L.EDT < R.EDT is judged? for being carry out step S35), otherwise carry out step S36).
S35) splitting R in L.EDT moment point is that R1, R2. delete L and order additional R1, R2 in TL, and sub-process terminates.
S36) in TL, delete L, add R., sub-process terminates.
Fig. 1 is illustrated, such as:
Suppose that input program log file contents is:
Input ad log file content is
Operational process step of the present invention is as follows:
The first step, loading program log file.Generate new the rendition list PL, namely load program log file (give tacit consent to the first behavior field name row, offical record is from the second row), carry out second step;
Second step, reading program recording are capable, read a line in program log
then the 3rd step is carried out;
3rd step, judge whether end-of-file, result is judged as NO, and carries out the 4th step;
4th step, generation program: according to the program log row read, generate new program P
P.Label＝”Start of Transmission”
P.Channel=" BTV "
P.Date＝”2010-11-15”
P.SDT＝”2010-11-15 02:00:00”
P.EDT＝”2010-11-15 02:00:01”
P.IsPriority=0, carries out the 5th step;
Do you 5th step, judge that names is SoT or EoT? result is judged as YES, and carries out the 6th step;
6th step, program priority is set to True, i.e. P.IsPriority=1, carries out the 7th step;
7th step, program is added the rendition list PL, add the rendition list PL by program P
PL={Label=" Start of Transmission ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" 2010-11-15 02:00:00 ", EDT=" 2010-11-15 02:00:01 ", IsPriority=1}, carries out second step; After all programs are drained, obtain following the rendition list PL:
PL={Label=" Start of Transmission ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:00:00 ", EDT=" and 2010-11-15 02:00:01 ", IsPriority=1},
Label=" and Shaolin Temple legend second 13 rod monk ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:00:00 ", EDT=" and 2010-11-15 02:16:59 ", IsPriority=0},
Label=" and the Xiang Guo world ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:16:59 ", EDT=" and 2010-11-15 02:27:01 ", IsPriority=0},
Label=" and TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:27:01 ", EDT=" and 2010-11-15 02:29:56 ", IsPriority=0},
Label=" and iron teeth copper tooth discipline morning mist the 4th ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:29:56 ", EDT=" and 2010-11-15 03:15:00 ", IsPriority=0},
Label=" and TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 03:15:00 ", EDT=" and 2010-11-15 03:19:00 ", IsPriority=0}
8th step, carrying advertisement journal file, generate new advertising listing AL, namely load journal file (give tacit consent to the first behavior field name row, offical record is from the second row): carry out the 9th step;
9th step, reading advertising record row, namely read a line in ad log
then the tenth step is carried out;
Tenth step, judge whether end-of-file, result is judged as NO, and carries out the 11 step;
11 step, generating advertisement: namely according to the ad log row read, generate new advertisement A.
A={Label=" TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:26:57 ", EDT=" and 2010-11-15 02:29:52 ", carry out the 12 step;
12 step, judge the EDT of SDT >=upper article record, result is judged as YES, and carries out the 13 step;
13 step, advertisement is added advertising listing AL, after all advertising listings are drained, obtains following the rendition list AL:
AL={Label=" TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:26:57 ", EDT=" and 2010-11-15 02:29:52 ",
Label=" and this media and communications ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:29:52 ", EDT=" and 2010-11-15},
Label=" and TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 03:14:59 ", EDT=" and 2010-11-15 03:19:59},
Label=" and public and social interest ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 03:19:59 ", EDT=" and 2010-11-15 03:20:59},
... carry out the 14 step;
14 step, newly-built timeline TL: namely TL is the object set of a holding time line record, what preserve in timeline can be program, and can be advertisement, also can be debug signal, there is attribute { ProgramName, Channel, Date, SDT, EDT}, carry out the 15 step;
15 step, initialization pi, ai: i.e. pi=0, ai=0.Pi and ai is the call number of object elements in gathering for index PL and AL.Carry out the 16 step;
Do you 16 step, judge pi+ai < PL.Count+AL.Count? result is judged as NO, and carries out the 17 step;
17 step, judge PL [pi] not as empty, and AL [ai] be sky, result is judged as YES, and carries out the 18 step;
18 step, judge PL [pi] .SDT < AL [ai] .SDT, result is judged as YES, and carries out the 19 step;
19 step, enter sub-process S-PL [pi] is compared with the last item record of time shaft, and add TL according to rule, carry out the 20 step;
20 step, pi++, namely the call number of cumulative PL, carries out the 21 step;
21 step, judge there is not new channel in TL, result is judged as NO, and carries out the 22 step;
22 step, preservation new channel, namely preserve " BTV " to database, carry out the 23 step;
Do you 23 step, judge there is not new program in TL? result is judged as NO, and carries out the 24 step;
24 step, determine program macrotaxonomy according to program category (program/advertisement/skill adjust), and preserve new program, carry out the 25 step;
25 step, holding time line are to database.
As follows to illustrating of Fig. 2:
Suppose existing
PL={Label=" Start of Transmission ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:00:00 ", EDT=" and 2010-11-15 02:00:01 ", IsPriority=1},
Label=" and Shaolin Temple legend second 13 rod monk ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:00:00 ", EDT=" and 2010-11-15 02:16:59 ", IsPriority=0},
Label=" and the Xiang Guo world ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:16:59 ", EDT=" and 2010-11-15 02:27:01 ", IsPriority=0},
Label=" and TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:27:01 ", EDT=" and 2010-11-15 02:29:56 ", IsPriority=0},
Label=" and iron teeth copper tooth discipline morning mist the 4th ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:29:56 ", EDT=" and 2010-11-15 03:15:00 ", IsPriority=0},
Label=" and TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 03:15:00 ", EDT=" and 2010-11-15 03:19:00 ", IsPriority=0}
AL={Label=" TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:26:57 ", EDT=" and 2010-11-15 02:29:52 ",
Label=" and this media and communications ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:29:52 ", EDT=" and 2010-11-15 02:29:57 ",
Label=" and TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 03:14:59 ", EDT=" and 2010-11-15 03:19:59 ",
Label=" and public and social interest ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 03:19:59 ", EDT=" and 2010-11-15 03:20:59 ",
TL={Label=" Start of Transmission ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:00:00 ", EDT=" and 2010-11-15 02:00:01 ", IsPriority=1},
Label=" and Shaolin Temple legend second 13 rod monk ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:00:00 ", EDT=" and 2010-11-15 02:16:59 ", IsPriority=0},
Label=" and the Xiang Guo world ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:16:59 ", EDT=" and 2010-11-15 02:27:01 ", IsPriority=0}
Execution step is as follows:
A, create new timeline record R according to PL [pi] or AL [ai]: i.e. R=AL [0]=Label=" TV guide ", Channel=" BTV ", Date=" 2010-11-15 ", SDT=" 2010-11-15 02:26:57 ", EDT=" and 2010-11-15 02:29:52 ";
Do you B, judge that TL is as empty? result is judged as NO, and carries out step C;
C, by the last item record assignment of TL to L: i.e. L={Label=" Xiang Guo is international ", Channel=" BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:16:59 ", EDT=" 2010-11-15 02:27:01 ", IsPriority=0};
Do you D, judge that the program category of L is identical with R? result is judged as NO, and carries out step e;
Do you E, judge L.SDT=R.SDT? result is judged as NO, and carries out step F;
Do you F, judge L.SDT < R.SDT? result is judged as YES, and carries out step G;
Do you G, judge L.EDT < R.SDT? result is judged as NO, and carries out step H;
Do you H, judge that L is program and not preferential? result is judged as YES, and carries out step I;
Do you I, judge L.EDT > R.SDT and L.EDT < R.EDT? result is judged as YES, and carries out step J;
J, R.SDT moment point split L be L1, L2; Splitting R at L.EDT is that R1, R2. delete L from TL, and order adds L1, R1, R2,
I.e. L1={Label=" the Xiang Guo world ", Channel=" and BTV ", Date " and 2010-11-15 ", SDT=" and 2010-11-15 02:16:59 ", EDT=" and 2010-11-15 02:26:57 ", IsPriority=0}
L2={Label=" the Xiang Guo world ", Channel=" and BTV ", Date " and 2010-11-15 ", SDT=" and 2010-11-15 02:26:57 ", EDT=" and 2010-11-15 02:27:01 ", IsPriority=0}
R1={Label=" TV guide ", Channel=" and BTV ", Date " and 2010-11-15 ", SDT=" and 2010-11-15 02:26:57 ", EDT=" and 2010-11-15 02:27:01 "
R2={Label=" TV guide ", Channel=" and BTV ", Date=" and 2010-11-15 ", SDT=" and 2010-11-15 02:27:01 ", EDT=" and 2010-11-15 02:29:52 "
TL adds L1, R1, R2, end of subroutine.
After flow process all completes, timeline result is as shown in table 1, (only listing critical field)
Table 1. flow performing result
| Sequence number | Programm name | Date | Channel | Time started | End time |
| 1 | Start of Transmission | 11/15/2010 | BTV | 2:00:00AM | 2:00:01AM |
| 2 | Shaolin Temple legend second 13 rod monk | 11/15/2010 | BTV | 2:00:00AM | 2:16:59AM |
| 3 | Xiang Guo is international | 11/15/2010 | BTV | 2:16:59AM | 2:26:57AM |
| 4 | TV guide | 11/15/2010 | BTV | 2:26:57AM | 2:27:01AM |
| 5 | TV guide | 11/15/2010 | BTV | 2:27:01AM | 2:29:52AM |
| 6 | This media and communications | 11/15/2010 | BTV | 2:29:52AM | 2:29:56AM |
| 7 | Iron teeth copper tooth discipline morning mist the 4th | 11/15/2010 | BTV | 2:29:56AM | 3:14:59AM |
| 8 | TV guide | 11/15/2010 | BTV | 3:14:59AM | 3:15:00AM |
| 9 | TV guide | 11/15/2010 | BTV | 3:15:00AM | 3:19:00AM |
| 10 | Advertisement | 11/15/2010 | BTV | 3:19:00AM | 3:19:59AM |
| 11 | Public and social interest | 11/15/2010 | BTV | 3:19:59AM | 3:20:59AM |
| 12 | Advertisement | 11/15/2010 | BTV | 3:20:59AM | 3:21:00AM |
As shown in Figure 3, hardware system involved by said method runs comprises program log document storage server 1, ad log document storage server 2, data processing server 3, database server 4, and wherein program log document storage server 1, ad log document storage server 2, data processing server 3 and database server 4 are connected by local area network (LAN).
Claims (4)
1., for a processing method for the broadcast content timeline data of television program assessment, it is characterized in that, this processing method comprises the following steps:
1) data processing server loads the program log file in program log document storage server, generates new program data, carry out step 2 after having loaded);
2) the ad log file in data processing server carrying advertisement journal file storage server, generates new advertising listing data, carry out step 3 after having loaded);
3) new timeline object set is set up, merged in timeline object set according to time order and function and priority by ad data in program data in new the rendition list and new advertising listing, then holding time line object set is to database server;
Described step 3) specifically comprise the following steps:
31) set up new timeline object set, judge whether to process all program datas in new the rendition list and all ad datas in new advertising listing, then carry out step 32 if the judgment is Yes), otherwise carry out step 34);
32) detect in new timeline object set whether there is new channel, then preserve new channel if the judgment is Yes to database, carry out step 33), otherwise directly carry out step 33);
33) judge whether there is new program in new timeline object set, then preserve new timeline object set if the judgment is Yes to database, terminate;
34) judge that whether new the rendition list and new advertising listing are all not for empty, if the judgment is Yes, then carry out steps 35), otherwise carry out step 38);
35) judge whether the initial time of the program data in new the rendition list is less than the initial time of the ad data in new advertising listing, if the judgment is Yes, then carry out step 36), otherwise carry out step 37);
36) enter sub-process, select the program data in new the rendition list to compare with the last item record of time shaft in chronological order, and add new timeline object set according to rule, after having sorted, carry out step 31);
37) enter sub-process, select the ad data in new advertising listing to compare with the last item record of time shaft in chronological order, and add new timeline object set according to rule, after having sorted, carry out step 31);
38) if new the rendition list is not empty, then carry out step 36);
39) if new advertising listing is not empty, then carry out step 37).
2. the processing method of a kind of broadcast content timeline data for television program assessment according to claim 1, is characterized in that, described step 1) specifically comprise the following steps:
11) program recording read in program log file is capable, and determines whether end-of-file, then terminates if the judgment is Yes, otherwise carry out step 12);
12) program A is regenerated in a new format by capable for program recording, whether the title then judging program A is " program starts " or " program terminates ", if the judgment is Yes, then carry out step 13), otherwise judge whether the time started of program A equals the end time of the program B that regenerates, if the judgment is Yes, then program A is added new the rendition list, otherwise carry out step 14);
13) priority of program A is set to very, if the name of program A is called " program starts ", program A is added new the rendition list, then carry out step 11), if the name of program A is called " program terminates ", then program A is added new the rendition list, terminate;
14) judge whether the time started of program A is greater than the end time of program B, if the judgment is Yes, then regenerate new program C, and joined new the rendition list, carry out step 11), otherwise carry out step 15);
15) program journal file misregistration is described, forwards to and manually process, and terminate.
3. the processing method of a kind of broadcast content timeline data for television program assessment according to claim 1, is characterized in that, described step 2) specifically comprise the following steps:
21) read the advertising record row of ad log file, and determine whether end-of-file, then terminate if the judgment is Yes, otherwise carry out step 22);
22) advertising record row is regenerated advertisement A in a new format, then judge whether the time started of advertisement A is more than or equal to the end time of the advertisement B that regenerates, if the judgment is Yes, then advertisement A is added new advertising listing, carry out step 21), otherwise carry out step 23);
23) ad log file record mistake is described, forwards to and manually process, and terminate.
4. the processing method of a kind of broadcast content timeline data for television program assessment according to claim 3, is characterized in that, described step 36) or step 37) in sub-process include following steps:
501) new timeline record R is created according to new the rendition list or new advertising listing;
502) judge whether new timeline object set is empty, and if the judgment is Yes, then in new timeline object set, add new timeline record R, sub-process terminates, otherwise carry out step 503);
503) judge that whether the program category of the last item record is identical with new timeline record R, if the judgment is Yes, then in new timeline object set, add new timeline record R, otherwise carry out step 504);
504) judge that whether the initial time of the last item record L is identical with the initial time of new timeline record R, if the judgment is Yes, then carry out step 505), otherwise carry out step 501);
505) judge that whether the end time of the last item record L is identical with the end time of new timeline record R, if the judgment is Yes, then carry out step 506), otherwise carry out step 507);
506) judge that whether the last item record L is preferential, if the judgment is Yes, then sub-process terminates, otherwise deletes the last item record L from new timeline object set, and adds new timeline record R in new timeline object set, and sub-process terminates;
507) judge whether the end time of the last item record L is less than the end time of new timeline record R, if the judgment is Yes, then carry out step 508), otherwise carry out step 509);
508) put as node with the end time of the last item record L, new timeline record R is split as leading portion and back segment, then judge that whether the last item record L is preferential, if the judgment is Yes, in then new timeline object set, order adds the back segment of new timeline record R, and sub-process terminates, otherwise deletes the last item record L from new timeline object set, and new timeline record R is added in new timeline object set, sub-process terminates;
509) put as node with the end time of new timeline record R, the last item record L is split as leading portion and back segment, then judge that whether the last item record L is preferential, if YES, then sub-process terminates, otherwise carry out step 510);
510) from new timeline object set, delete the last item record L, and order adds the back segment of new timeline record R and the last item record L in new timeline object set, sub-process terminates;
511) judge whether the initial time of the last item record L is less than the initial time of new timeline record R identical, if the judgment is Yes, then carry out step 512), otherwise carry out step 525);
512) judge whether the end time of the last item record L is less than the end time of new timeline record R, if the judgment is Yes, then carry out step 513), otherwise carry out step 514);
513) in the end generate new record " technological debugging " between end time of a record L and the initial time of new timeline record R, and add new record " technological debugging " in new timeline object set, sub-process terminates;
514) judge whether the last item record L is program and preferentially, then carry out step 515 if the judgment is Yes), otherwise carry out step 521);
515) judge whether the end time of the last item record L is greater than the initial time of new timeline record R and is less than end time of new timeline record R simultaneously, then carry out step 516 if the judgment is Yes), otherwise carry out step 517);
516) with the initial time of new timeline record R for node, the last item record L is split as leading portion and back segment, then with the end time of the last item record L for node, new for fractionation timeline record R is split as leading portion and back segment, the last item record L is deleted from new timeline object set, and order adds the leading portion of the last item record L, the leading portion of new timeline record R, the back segment of new timeline record R in new timeline object set, sub-process terminates;
517) judge whether the end time of the last item record L is greater than the end time of new timeline record R, if the judgment is Yes, then carry out step 518), otherwise carry out step 519);
518) with the initial time of new timeline record R and end time for node, fractionation the last item record L is split as leading portion, stage casing, back segment, the last item record L is deleted from new timeline object set, and order adds the back segment of the leading portion of the last item record L, new timeline record R, the last item record L, sub-process terminates;
519) judge whether the end time of the last item record L equals the end time of new timeline record R, if the judgment is Yes, then carry out step 520), otherwise new timeline record R is added in new timeline object set, sub-process terminates;
520) with the initial time of new timeline record R for node, fractionation the last item record L is split as leading portion and back segment, then from new timeline object set, delete the last item record L, and order adds the leading portion of the last item record L and new timeline record R, sub-process terminates;
521) if the last item record L is not new record " technological debugging " and the last item record L is not advertisement, then carry out step 522), otherwise directly in new timeline object set, add new timeline record R; If the last item record L is not new record " technological debugging " and the last item record L is preferential, then carry out step 522), otherwise directly in new timeline object set, add new timeline record R;
522) judge whether the end time of the last item record L is greater than the initial time of new timeline record R and the end time of the last item record L is less than end time of new timeline record R, if the judgment is Yes, then carry out step 523), otherwise carry out step 524);
523) with the initial time of new timeline record R for node, the last item record L is split leading portion and back segment, with the end time of the last item record L for node, new timeline record R is split as leading portion and back segment, then from new timeline object set, the last item record L is deleted, and order adds the back segment of the leading portion of the last item record L, the back segment of the last item record L and new timeline record R, sub-process terminates;
524) judge whether the end time of the last item record L is more than or equal to the end time of new timeline record R, and if the judgment is Yes, then sub-process terminates, otherwise directly in new timeline object set, add new timeline record R;
525) judge whether the end time of the last item record L is greater than the end time of new timeline record R, if the judgment is Yes, then carry out step 526), otherwise carry out step 527);
526) with the end time of new timeline record R for node, the last item record L is split leading portion and back segment, then from new timeline object set, delete the last item record L, and order adds the back segment of new timeline record R and the last item record L, sub-process terminates;
527) judge whether the end time of the last item record L is less than the end time of new timeline record R, if the judgment is Yes, then carry out step 528), otherwise carry out step 529);
528) with the end time of the last item record L for node, new timeline record R is split as leading portion and back segment, then from new timeline object set, delete the last item record L, and order adds the leading portion of new timeline record R and the back segment of new timeline record R;
529) from new timeline object set, delete the last item record L, then add new timeline record R, sub-process terminates.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110253503.6A CN102957948B (en) | 2011-08-30 | 2011-08-30 | A kind of processing method of the broadcast content timeline data for television program assessment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110253503.6A CN102957948B (en) | 2011-08-30 | 2011-08-30 | A kind of processing method of the broadcast content timeline data for television program assessment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102957948A CN102957948A (en) | 2013-03-06 |
| CN102957948B true CN102957948B (en) | 2015-10-07 |
Family
ID=47766092
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110253503.6A Expired - Fee Related CN102957948B (en) | 2011-08-30 | 2011-08-30 | A kind of processing method of the broadcast content timeline data for television program assessment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102957948B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106060589B (en) * | 2016-05-31 | 2019-04-12 | 无锡天脉聚源传媒科技有限公司 | A kind of analysis method and device of programme information |
| CN107888977A (en) * | 2017-11-27 | 2018-04-06 | 山东浪潮商用系统有限公司 | A kind of method and device for detecting electronic program guides |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1968389A (en) * | 2005-11-18 | 2007-05-23 | 株式会社日立制作所 | Recording reproduction device |
| CN101640777A (en) * | 2008-07-31 | 2010-02-03 | 富士通株式会社 | Video reproducing device and video reproducing method |
| CN101883252A (en) * | 2010-05-31 | 2010-11-10 | 中山大学 | Digital television visual media information feedback system and method thereof |
| CN101978692A (en) * | 2008-04-03 | 2011-02-16 | 爱立信电话股份有限公司 | Interactive media system and method for dimensioning interaction servers in an interactive media system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100095345A1 (en) * | 2008-10-15 | 2010-04-15 | Samsung Electronics Co., Ltd. | System and method for acquiring and distributing keyframe timelines |
-
2011
- 2011-08-30 CN CN201110253503.6A patent/CN102957948B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1968389A (en) * | 2005-11-18 | 2007-05-23 | 株式会社日立制作所 | Recording reproduction device |
| CN101978692A (en) * | 2008-04-03 | 2011-02-16 | 爱立信电话股份有限公司 | Interactive media system and method for dimensioning interaction servers in an interactive media system |
| CN101640777A (en) * | 2008-07-31 | 2010-02-03 | 富士通株式会社 | Video reproducing device and video reproducing method |
| CN101883252A (en) * | 2010-05-31 | 2010-11-10 | 中山大学 | Digital television visual media information feedback system and method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102957948A (en) | 2013-03-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110351578B (en) | Method and system for automatically producing video programs according to scripts | |
| CN100382577C (en) | Method and apparatus for analyzing subtitles in a video | |
| US8972374B2 (en) | Content acquisition system and method of implementation | |
| US8479228B1 (en) | Customization of advertisements to content of video data | |
| US20070239883A1 (en) | Devices, systems, and methods for producing and distributing multiple variations of an instance of a media presentation | |
| CN103348322A (en) | Information processing device, information processing method, and program | |
| US10341710B2 (en) | Program recording method and device, and set top box | |
| CN105025318A (en) | Feedback method and device for abnormal log information of application program | |
| CN102752540A (en) | Automatic categorization method based on face recognition technology | |
| CN103310001B (en) | A kind of method and apparatus that list of videos is set | |
| CN102957948B (en) | A kind of processing method of the broadcast content timeline data for television program assessment | |
| CN105338379B (en) | Soft broadcast data monitoring and mining system and method thereof | |
| CN111428077A (en) | Information processing method and terminal thereof | |
| CN102007764A (en) | Method of storing and displaying broadcast contents and apparatus therefor | |
| CN102194504A (en) | Media file play method, player and server for playing medial file | |
| US20080196054A1 (en) | Method and system for facilitating analysis of audience ratings data for content | |
| US20100293072A1 (en) | Preserving the Integrity of Segments of Audio Streams | |
| CN102681883B (en) | Resource calling method and system in media asset searching and browsing system | |
| CN113298106A (en) | Sample generation method and device, server and storage medium | |
| CN110611833A (en) | IPTV content publishing system and method | |
| CN108337503B (en) | Digital television field environment simulation method, terminal and computer readable medium | |
| CN102723091B (en) | Rough editing method based on electronic news gathering ENG material uploading | |
| US20130045717A1 (en) | Multimedia Message Saving Method and Mobile Terminal | |
| CN115665108B (en) | All-media content production data management platform applied to financial system | |
| JP2009049638A (en) | Information processing system, method and program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20151007 Termination date: 20210830 |